作者: Glucocorticoids 時間: 2025-3-21 22:39
On Maximum Rank Aggregation Problemse expressed by permutations, whose distance can be measured in many ways..In this work we study a collection of distances, including the Kendall tau, Spearman footrule, Spearman rho, Cayley, Hamming, Ulam, and Minkowski distances, and compute the consensus against the maximum, which attempts to mini作者: moribund 時間: 2025-3-22 00:34
Deciding Representability of Sets of Words of Equal Length in Polynomial Timee words. Recently, the computational problem of representing subsets of .. by ., which are sequences that may have holes that match each letter of ., was considered and shown to be in .. However, membership in . remained open. In this paper, we show that deciding if a subset is representable can be 作者: Crepitus 時間: 2025-3-22 05:10
Prefix Table Construction and ConversionIn this paper we describe and evaluate algorithms for prefix table construction, some previously proposed, others designed by us. We also describe and evaluate new linear-time algorithms for transformations between . and the ..作者: 漂白 時間: 2025-3-22 09:52
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas, we ask for a minimum-size set of variables to be split in order to make the formula satisfiable. This problem is known to be APX-hard, even for 2-CNF formulas. We consider the case of 2-CNF Horn formulas, i.e., 2-CNF formulas without positive 2-clauses, and prove that this problem is APX-hard as w作者: 借喻 時間: 2025-3-22 13:28
Boundary-to-Boundary Flows in Planar Graphshm uses only .(.) queries to simple data structures, achieving an .(. log.) running time that we expect to be practical given the use of simple primitives. The only existing algorithm for this problem uses divide and conquer and, in order to achieve an .(. log.) running time, requires the use of the作者: 借喻 時間: 2025-3-22 18:47
Exact Algorithms for Weak Roman Domination .: .?→?{0,1,2} such that every vertex .?∈?. is . (. there exists a neighbor . of ., possibly .?=?., such that .) and for every vertex .?∈?. with .(.)?=?0 there exists a neighbor . of . such that . and the function .. defined by:. does not contain any undefended vertex. The . of a wrd-function . is 作者: assent 時間: 2025-3-23 00:24 作者: GET 時間: 2025-3-23 02:06 作者: Host142 時間: 2025-3-23 06:25 作者: 小卒 時間: 2025-3-23 09:52
Phase Transition of Random Non-uniform Hypergraphs structure before and near the birth of the . component, that is the first connected component with more than one cycle. The model of non-uniform hypergraph studied is a natural generalization of the . defined in the “giant paper” [1]. This paper follows the same general approach based on analytic c作者: 無可爭辯 時間: 2025-3-23 14:22 作者: 斗爭 時間: 2025-3-23 20:00 作者: 熱情的我 時間: 2025-3-24 01:02
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classess of bounded vertex-cover. The first one shows that the model checking problem for cardMSO., an extension of the well-known Monadic Second-Order logic by the addition of cardinality constraints, can be solved in FPT time parameterized by vertex cover. The second meta-theorem shows that the MSO parti作者: FACT 時間: 2025-3-24 02:40
Dynamising Interval Scheduling: The Monotonic Caseterval properly contains another interval. We provide two data structures for representing the intervals that allow efficient insertion, removal and various query operations. The first dynamic algorithm, based on the data structure called compatibility forest, runs in amortised time .(log..) for ins作者: Musculoskeletal 時間: 2025-3-24 10:23 作者: Nausea 時間: 2025-3-24 13:06 作者: exclamation 時間: 2025-3-24 18:53
Structural Properties of Subdivided-Line Graphsed-line graph Γ.(.) of a graph .. We then study structural properties of subdivided-line graphs such as edge-disjoint Hamilton cycles, hub sets, connected dominating sets, and completely independent spanning trees which can be applied to problems on interconnection networks. From our results, the ma作者: 的是兄弟 時間: 2025-3-24 22:00 作者: 繼承人 時間: 2025-3-24 23:12 作者: 產(chǎn)生 時間: 2025-3-25 04:18 作者: right-atrium 時間: 2025-3-25 11:09
https://doi.org/10.1007/978-1-4615-7861-1In this paper we describe and evaluate algorithms for prefix table construction, some previously proposed, others designed by us. We also describe and evaluate new linear-time algorithms for transformations between . and the ..作者: 收藏品 時間: 2025-3-25 13:40
https://doi.org/10.1007/978-1-4615-7861-1, we ask for a minimum-size set of variables to be split in order to make the formula satisfiable. This problem is known to be APX-hard, even for 2-CNF formulas. We consider the case of 2-CNF Horn formulas, i.e., 2-CNF formulas without positive 2-clauses, and prove that this problem is APX-hard as w作者: Mammal 時間: 2025-3-25 16:23 作者: Impugn 時間: 2025-3-25 23:38
Brands as Agents of Social Change, .: .?→?{0,1,2} such that every vertex .?∈?. is . (. there exists a neighbor . of ., possibly .?=?., such that .) and for every vertex .?∈?. with .(.)?=?0 there exists a neighbor . of . such that . and the function .. defined by:. does not contain any undefended vertex. The . of a wrd-function . is 作者: Accolade 時間: 2025-3-26 02:19 作者: Factual 時間: 2025-3-26 06:06 作者: Ptosis 時間: 2025-3-26 09:55 作者: exclamation 時間: 2025-3-26 14:00
Karina Boege,Kasey E. Barton,Rodolfo Dirzo structure before and near the birth of the . component, that is the first connected component with more than one cycle. The model of non-uniform hypergraph studied is a natural generalization of the . defined in the “giant paper” [1]. This paper follows the same general approach based on analytic c作者: 藥物 時間: 2025-3-26 20:47
Kathy Steppe,ülo Niinemets,Robert O. Teskeytami Covering. As a consequence it is therefore NP-complete to decide whether there is a perfect matching of a graph that meets every 4-cycle, even if the graph is restricted to be an induced subgraph of the grid-graph. The gadgets used in the reduction were discovered with the help of a .-solver.作者: 調(diào)情 時間: 2025-3-26 21:31 作者: Microgram 時間: 2025-3-27 03:35 作者: Ingest 時間: 2025-3-27 06:04 作者: OUTRE 時間: 2025-3-27 10:45 作者: HALO 時間: 2025-3-27 15:15 作者: Genteel 時間: 2025-3-27 18:23
https://doi.org/10.1007/978-3-642-74001-5ed-line graph Γ.(.) of a graph .. We then study structural properties of subdivided-line graphs such as edge-disjoint Hamilton cycles, hub sets, connected dominating sets, and completely independent spanning trees which can be applied to problems on interconnection networks. From our results, the ma作者: Confidential 時間: 2025-3-27 23:46 作者: Melodrama 時間: 2025-3-28 03:07
978-3-642-45277-2Springer-Verlag Berlin Heidelberg 2013作者: 乳白光 時間: 2025-3-28 07:42 作者: 進步 時間: 2025-3-28 13:09
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229887.jpg作者: 駁船 時間: 2025-3-28 17:13 作者: POWER 時間: 2025-3-28 20:34
https://doi.org/10.1007/978-1-4615-7861-1In this paper we describe and evaluate algorithms for prefix table construction, some previously proposed, others designed by us. We also describe and evaluate new linear-time algorithms for transformations between . and the ..作者: 我吃花盤旋 時間: 2025-3-28 23:09
Kathy Steppe,ülo Niinemets,Robert O. Teskeytami Covering. As a consequence it is therefore NP-complete to decide whether there is a perfect matching of a graph that meets every 4-cycle, even if the graph is restricted to be an induced subgraph of the grid-graph. The gadgets used in the reduction were discovered with the help of a .-solver.作者: 勤勉 時間: 2025-3-29 05:28 作者: NUL 時間: 2025-3-29 10:45
J. A. J. Metz,A. M. de Roos,F. van den Bosch . is known only for .. In this paper we present a tight upper bound on the diameter of the Kn?del graph for general case. We show that the presented bound differs from the diameter by at most 2 when . for some 0?
作者: 粗魯?shù)娜?nbsp; 時間: 2025-3-29 11:56 作者: 火光在搖曳 時間: 2025-3-29 17:17 作者: labile 時間: 2025-3-29 22:30 作者: 起來了 時間: 2025-3-30 01:56
Tight Bound on the Diameter of the Kn?del Graph . is known only for .. In this paper we present a tight upper bound on the diameter of the Kn?del graph for general case. We show that the presented bound differs from the diameter by at most 2 when . for some 0?
作者: impale 時間: 2025-3-30 07:55 作者: Forsake 時間: 2025-3-30 10:04
K. D. Bartle,I. L. Davies,M. W. RaynorWe consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robot’s walk is chosen using only local information. In this paper, we present some current developments in the area. In particular, we focus on recent work on . and on the ..作者: 狼群 時間: 2025-3-30 13:18
Efficient Exploration of Anonymous Undirected GraphsWe consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robot’s walk is chosen using only local information. In this paper, we present some current developments in the area. In particular, we focus on recent work on . and on the ..作者: JAUNT 時間: 2025-3-30 16:56
Brands as Agents of Social Change,are breaking the trivial enumeration barrier by providing two faster algorithms: we first prove that the problem can be solved in . time needing ., and then describe an . algorithm using .. Our results rely on structural properties of a wrd-function, as well as on the best polynomial space algorithm for the . problem.作者: commute 時間: 2025-3-30 21:49 作者: essential-fats 時間: 2025-3-31 03:12
https://doi.org/10.1007/978-3-642-74001-5ximum number of completely independent spanning trees in Sierpiński graphs are obtained as corollaries. In particular, our results for edge-disjoint Hamilton cycles and hub sets on iterated subdivided-line graphs are generalizations of the previously known results on Sierpiński graphs, while our proofs are simpler than those for Sierpiński graphs.作者: 辮子帶來幫助 時間: 2025-3-31 05:57 作者: 執(zhí) 時間: 2025-3-31 10:52
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classesat these formalisms can describe problems which are W[1]-hard and even NP-hard on graphs of bounded tree-width. Additionally, our algorithms have only elementary dependence on the parameter and formula. We also show that both results are easily extended from vertex cover to neighborhood diversity.作者: ARC 時間: 2025-3-31 16:30
Structural Properties of Subdivided-Line Graphsximum number of completely independent spanning trees in Sierpiński graphs are obtained as corollaries. In particular, our results for edge-disjoint Hamilton cycles and hub sets on iterated subdivided-line graphs are generalizations of the previously known results on Sierpiński graphs, while our proofs are simpler than those for Sierpiński graphs.作者: Phenothiazines 時間: 2025-3-31 19:52 作者: FLOAT 時間: 2025-3-31 21:46 作者: 使服水土 時間: 2025-4-1 05:02
Aqueous size exclusion chromatographyives. The only existing algorithm for this problem uses divide and conquer and, in order to achieve an .(. log.) running time, requires the use of the (complicated) linear-time shortest-paths algorithm for planar graphs.作者: 合乎習(xí)俗 時間: 2025-4-1 06:36
Deciding Representability of Sets of Words of Equal Length in Polynomial Timewas considered and shown to be in .. However, membership in . remained open. In this paper, we show that deciding if a subset is representable can be done in polynomial time. Our approach is graph theoretical.作者: fastness 時間: 2025-4-1 11:19
Boundary-to-Boundary Flows in Planar Graphsives. The only existing algorithm for this problem uses divide and conquer and, in order to achieve an .(. log.) running time, requires the use of the (complicated) linear-time shortest-paths algorithm for planar graphs.
