作者: 斑駁 時(shí)間: 2025-3-21 21:02 作者: Vulnerary 時(shí)間: 2025-3-22 01:12
Parameterized Longest Previous Factor,g) is a sophisticated string composed of symbols from a constant alphabet Σ and a parameter alphabet Π. We generalize the LPF problem to the parameterized longest previous factor (pLPF) problem defined for p-strings. Subsequently, we present a linear time solution to construct the . array. Given our作者: 造反,叛亂 時(shí)間: 2025-3-22 06:04 作者: 心神不寧 時(shí)間: 2025-3-22 11:21 作者: 廣口瓶 時(shí)間: 2025-3-22 15:49
The 1-Neighbour Knapsack Problem,can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.作者: 廣口瓶 時(shí)間: 2025-3-22 17:45 作者: 尊重 時(shí)間: 2025-3-22 23:09
,Stable Sets of Threshold-Based Cascades on the Erd?s-Rényi Random Graphs,a given .?∈?( 0,1 ], a non-isolated vertex is activated (resp., deactivated) in round .?∈??. if the fraction . of its neighboring vertices that were active in round .???1 satisfies .?≥?. (resp., .?
作者: 否決 時(shí)間: 2025-3-23 05:23 作者: Radiation 時(shí)間: 2025-3-23 05:37 作者: 指派 時(shí)間: 2025-3-23 11:36
Complexity of Cycle Transverse Matching Problems,transversal problems generalize several vertex partition problems and have been studied for various classes of graphs. Following a result of Farrugia, the stable transversal problem for each .. with ??≥?3 is NP-complete. In this paper, we study an ‘edge version’ of these problems. Specifically, we i作者: 并置 時(shí)間: 2025-3-23 14:20 作者: Chronological 時(shí)間: 2025-3-23 18:06
2-Layer Right Angle Crossing Drawings,e edges are straight-line segments. In this paper we study 2-layer drawings where all edge crossings form right angles. We characterize which graphs admit this type of drawing, provide linear-time testing and embedding algorithms, and present a polynomial-time crossing minimization technique. Also, 作者: indignant 時(shí)間: 2025-3-23 22:59
Hamiltonian Orthogeodesic Alternating Paths,f different colour and no two edges cross. We consider the problem of deciding whether there exists a . orthogeodesic alternating path, i.e., an orthogeodesic alternating path visiting all points. We provide an .(. log..)-time algorithm for finding such a path if no two points are horizontally or ve作者: 我不怕?tīng)奚?nbsp; 時(shí)間: 2025-3-24 05:42
Ranking and Loopless Generation of ,-ary Dyck Words in Cool-lex Order,he number of 1s. We provide two loopless algorithms for generating .-ary Dyck words in cool-lex order: (1) The first requires two index variables and assumes . is a constant; (2) The second requires . index variables and works for any .. We also efficiently rank .-ary Dyck words in cool-lex order. O作者: 倔強(qiáng)一點(diǎn) 時(shí)間: 2025-3-24 08:40
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort,t comparisons, where . is the number of elements stored. One priority queue is based on a weak heap (array-based) and the other on a weak queue (pointer-based). In both, the main idea is to temporarily store the inserted elements in a buffer, and once it is full to move its elements to the main queu作者: Systemic 時(shí)間: 2025-3-24 11:14
A Unifying Property for Distribution-Sensitive Priority Queues, .. (respectively, ..) is the number of elements that were accessed after (respectively, before) the last access of . and are still in the priority queue at the time when the corresponding operation is performed. Our priority queue then has both the working-set and the queueish properties; and, more作者: 衰弱的心 時(shí)間: 2025-3-24 16:26
Enumerating Tatami Mat Arrangements of Square Grids,2., when . and . have the same parity. In addition, we present a new proof of the result that there are .2. such tilings with . monomers, which divides the tilings into . classes of size 2.. The sum of these over all .?≤?. has the closed form 2.(3.???4)?+?2 and, curiously, this is equal to the sum o作者: 飲料 時(shí)間: 2025-3-24 22:56 作者: 拱墻 時(shí)間: 2025-3-25 00:59
Combinatorial Algorithms978-3-642-25011-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 退潮 時(shí)間: 2025-3-25 06:11 作者: 脫離 時(shí)間: 2025-3-25 08:23 作者: POINT 時(shí)間: 2025-3-25 15:13
The 1-Neighbour Knapsack Problem,can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.作者: 無(wú)辜 時(shí)間: 2025-3-25 18:03
Quasi-Cyclic Codes over ,,to .?=?9. In this paper, linear codes over . are constructed for . up to 6. The codes constructed are from the class of quasi-cyclic codes. In addition, the minimum distance of the extended quadratic residue code of length 44 is determined.作者: 六邊形 時(shí)間: 2025-3-25 23:19 作者: Limerick 時(shí)間: 2025-3-26 00:09
978-3-642-25010-1Springer-Verlag GmbH Berlin Heidelberg 2011作者: 不溶解 時(shí)間: 2025-3-26 05:00
Costas S. Iliopoulos,William F. SmythUp-to-date results.Fast track conference proceedings.State-of-the-art report作者: 新手 時(shí)間: 2025-3-26 08:36
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229875.jpg作者: 同步左右 時(shí)間: 2025-3-26 14:16 作者: 人造 時(shí)間: 2025-3-26 19:15
https://doi.org/10.1007/978-3-030-63223-6ithms and complexity. A . of a graph . is an assignment of colors to the vertices of . such that it is a proper coloring and every vertex dominates all the vertices of at least one color class. The minimum number of colors required for a dominator coloring of . is called the . of . and is denoted by作者: 消息靈通 時(shí)間: 2025-3-26 21:14
https://doi.org/10.1007/978-3-030-63223-6g) is a sophisticated string composed of symbols from a constant alphabet Σ and a parameter alphabet Π. We generalize the LPF problem to the parameterized longest previous factor (pLPF) problem defined for p-strings. Subsequently, we present a linear time solution to construct the . array. Given our作者: 別名 時(shí)間: 2025-3-27 01:24 作者: 帶傷害 時(shí)間: 2025-3-27 07:24 作者: 一夫一妻制 時(shí)間: 2025-3-27 09:34
Introduction: Exploring an Elephant,can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.作者: Missile 時(shí)間: 2025-3-27 16:06
https://doi.org/10.1007/978-3-642-41467-1meterized algorithms are known. We present a novel search tree algorithm for the problem, which improves running time from .*(1.76.) to .*(1.62.). In detail, we can show that we can always branch with branching vector (2,1) or better, resulting in the golden ratio as the base of the search tree size作者: adj憂郁的 時(shí)間: 2025-3-27 19:35
Examples of Constructed Processesa given .?∈?( 0,1 ], a non-isolated vertex is activated (resp., deactivated) in round .?∈??. if the fraction . of its neighboring vertices that were active in round .???1 satisfies .?≥?. (resp., .?
作者: panorama 時(shí)間: 2025-3-27 23:19
Examples of Constructed Processesis (1985) and conceptually related to the better known planar cover conjecture by Negami (1986). For over two decades, the planar emulator problem lived poorly in a shadow of Negami’s conjecture—which is still open—as the two were considered equivalent. But, in the end of 2008, a surprising construc作者: 的染料 時(shí)間: 2025-3-28 04:59
https://doi.org/10.1007/978-3-642-41467-1 monotone read-once functions of the same variables. We describe an inductive procedure for obtaining individual lower and upper bounds on the minimal number of vectors .(.) in a checking test for any function .. The task of deriving the exact value of .(.) is reduced to a combinatorial optimization作者: prolate 時(shí)間: 2025-3-28 07:09 作者: commonsense 時(shí)間: 2025-3-28 10:46 作者: corn732 時(shí)間: 2025-3-28 15:46 作者: Intrepid 時(shí)間: 2025-3-28 19:31 作者: 帽子 時(shí)間: 2025-3-29 01:11 作者: 無(wú)辜 時(shí)間: 2025-3-29 04:39
Situational Privacy and Self-Disclosuret comparisons, where . is the number of elements stored. One priority queue is based on a weak heap (array-based) and the other on a weak queue (pointer-based). In both, the main idea is to temporarily store the inserted elements in a buffer, and once it is full to move its elements to the main queu作者: 靦腆 時(shí)間: 2025-3-29 07:36 作者: 翻布尋找 時(shí)間: 2025-3-29 12:50 作者: Permanent 時(shí)間: 2025-3-29 16:41
Studies in Linguistics and Philosophyto .?=?9. In this paper, linear codes over . are constructed for . up to 6. The codes constructed are from the class of quasi-cyclic codes. In addition, the minimum distance of the extended quadratic residue code of length 44 is determined.作者: 強(qiáng)行引入 時(shí)間: 2025-3-29 20:34 作者: 來(lái)這真柔軟 時(shí)間: 2025-3-30 01:38 作者: 感染 時(shí)間: 2025-3-30 06:07 作者: anachronistic 時(shí)間: 2025-3-30 09:48
Examples of Constructed Processes and constructions which show how far the planar-emulability concept is from planar-coverability, and that the traditional idea of likening it to projective embeddability is actually very out-of-place. We also present several positive partial characterizations of planar-emulable graphs.作者: heterogeneous 時(shí)間: 2025-3-30 13:20
Examples of Constructed Processesd for each .. with ??≥?4 is NP-complete. Our results imply that the stable transversal problem for each .. with ??≥?4 remains NP-complete when it is restricted to line graphs. We show by contrast that the stable transversal problem for .., when restricted to line graphs, is polynomial.作者: 多余 時(shí)間: 2025-3-30 20:14
A Golden Ratio Parameterized Algorithm for Cluster Editing,s: First, we show that zero-edges in the graph enforce structural features that allow us to branch more efficiently. Second, by repeatedly branching we can isolate vertices, releasing costs. Finally, we use a known characterization of graphs with few conflicts.作者: Deadpan 時(shí)間: 2025-3-30 21:53
,Stable Sets of Threshold-Based Cascades on the Erd?s-Rényi Random Graphs,ces equals .. For both the reversible and the irreversible cascades, we show that for any constant .?>?0, all .?∈?[ (1?+?.) (ln (./.))/.,1 ] and with probability 1???.., every stable set of .(.,.) has size .(?.?) or .???.(?.?).作者: 機(jī)制 時(shí)間: 2025-3-31 01:58
How Not to Characterize Planar-Emulable Graphs, and constructions which show how far the planar-emulability concept is from planar-coverability, and that the traditional idea of likening it to projective embeddability is actually very out-of-place. We also present several positive partial characterizations of planar-emulable graphs.作者: 征兵 時(shí)間: 2025-3-31 06:04 作者: ESPY 時(shí)間: 2025-3-31 10:57
Conference proceedings 2011broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.作者: 冰雹 時(shí)間: 2025-3-31 13:48 作者: sparse 時(shí)間: 2025-3-31 20:00
https://doi.org/10.1007/978-3-030-63223-6 linear time algorithm for p-suffix sorting for non-binary parameter alphabets, which assumes that each code is represented by a practical integer. We eliminate the key problems of fingerprints by introducing an algorithm that exploits the ordering of arithmetic codes to sort p-suffixes in linear time on average.
