作者: 形容詞詞尾 時(shí)間: 2025-3-22 00:03 作者: 一大塊 時(shí)間: 2025-3-22 02:59 作者: optional 時(shí)間: 2025-3-22 07:01 作者: beta-cells 時(shí)間: 2025-3-22 08:57
Dmitrii S. Dudin,Ilya E. Kelleroperties. We show that the Full-Flag Johnson graphs are Cayley graphs on . generated by certain well-known classes of permutations and that they are in fact generalizations of permutahedra. Our main result will be to establish a tight . bound for the diameter of the Full-Flag Johnson graph .(.,?.).作者: Bouquet 時(shí)間: 2025-3-22 15:47
Combinatorial Properties of Full-Flag Johnson Graphs,operties. We show that the Full-Flag Johnson graphs are Cayley graphs on . generated by certain well-known classes of permutations and that they are in fact generalizations of permutahedra. Our main result will be to establish a tight . bound for the diameter of the Full-Flag Johnson graph .(.,?.).作者: Bouquet 時(shí)間: 2025-3-22 17:57
Conference proceedings 2016 in Verona, Italy, in October 2015..The 29 revised full papers presented were carefullyreviewed and selected from a total of 90 submissions. The topics of the papersinclude algorithms and data structures (including sequential, parallel,distributed, approximation, probabilistic, randomised, and on-li作者: 間接 時(shí)間: 2025-3-22 21:24
Conference proceedings 2016torial enumeration;combinatorial optimization; complexity theory; computational biology;compression and information retrieval; cryptography and information security;decompositions and combinatorial designs; discrete and computational geometry;graph drawing and labeling; graph theory...?.作者: 焦慮 時(shí)間: 2025-3-23 03:02 作者: 免費(fèi) 時(shí)間: 2025-3-23 05:36
https://doi.org/10.1007/978-1-349-27750-6al word, i.e., the longest substrings starting at . and . that are .. We show that our results match with those of total words (partial words without holes). We find that one of the simplest algorithms for implementing the LCE problem is optimal on average in this case.作者: 有法律效應(yīng) 時(shí)間: 2025-3-23 11:49
A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem, So far, no efficient cost-scaling algorithm is known for finding a minimum-cost perfect triangle-free 2-matching. The present paper fills this gap by presenting such an algorithm with time complexity of ..作者: Infiltrate 時(shí)間: 2025-3-23 14:08 作者: facilitate 時(shí)間: 2025-3-23 21:42 作者: engrave 時(shí)間: 2025-3-23 23:16 作者: Campaign 時(shí)間: 2025-3-24 03:03
https://doi.org/10.1007/978-3-662-44479-5 make progress towards answering that question by presenting a quadratic time algorithm to solve the tree containment problem for a new class of networks that we call genetically stable networks, which include tree-child networks and comprise a subclass of stable networks.作者: FER 時(shí)間: 2025-3-24 08:29
V. Shyamala Susan,A. P. Bambang Sugiyonoty, there are Freckle graphs where the greedy independent set algorithm is objectively less good than another algorithm..It is shown that it is .-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.作者: obstinate 時(shí)間: 2025-3-24 11:37
O. M. Belotserkovskii,A. S. Kholodov enumerating acyclic orientations. We show that the problem is of independent interest from both combinatorial and algorithmic points of view, and that each cyclic orientation can be listed with . delay time. Space usage is .(.) with an additional setup cost of . time before the enumeration begins, or .(.) with a setup cost of . time.作者: 健忘癥 時(shí)間: 2025-3-24 14:59
Dynamic Size Effect in Concrete Materials,(sub)trees. In particular, focusing on subtree computations, we show how to customize the data structure in order to answer queries for a concrete application: keeping track of the biconnectivity measures, including the impact of the removal of articulation points, of a dynamic undirected graph.作者: Insensate 時(shí)間: 2025-3-24 21:16
M. Stefan,S. V. Nistor,D. Ghicaus to determine polynomial-time approximation algorithms for different classes of graphs such as regular graphs, connected graphs and forests, but also for general graphs. Concerning exact algorithms, we show that the problem is solvable in . time, and that deciding whether there exist a labeling . of . such that . is solvable in ..作者: Veneer 時(shí)間: 2025-3-25 03:02
M. Stefan,S. V. Nistor,D. Ghicamum degree?. then .. We also provide tight upper bounds on the number of rounds until all nodes are active..For ., we denote by .(.,?.,?.) the maximum number of edges in an .-vertex graph . satisfying .. We determine the precise value of .(.,?.,?2) and .(.,?.,?.) assuming that?. is sufficiently large compared to?..作者: 濕潤 時(shí)間: 2025-3-25 04:23 作者: 植物學(xué) 時(shí)間: 2025-3-25 08:21 作者: Limousine 時(shí)間: 2025-3-25 15:37 作者: 有節(jié)制 時(shí)間: 2025-3-25 16:03
Algorithmic Aspects of the ,-Labeling Problem,us to determine polynomial-time approximation algorithms for different classes of graphs such as regular graphs, connected graphs and forests, but also for general graphs. Concerning exact algorithms, we show that the problem is solvable in . time, and that deciding whether there exist a labeling . of . such that . is solvable in ..作者: 彎曲的人 時(shí)間: 2025-3-25 22:25 作者: 叢林 時(shí)間: 2025-3-26 02:45 作者: Injunction 時(shí)間: 2025-3-26 07:57
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229886.jpg作者: Vertebra 時(shí)間: 2025-3-26 10:00 作者: liposuction 時(shí)間: 2025-3-26 15:25 作者: 污穢 時(shí)間: 2025-3-26 17:40 作者: Hypopnea 時(shí)間: 2025-3-26 23:34 作者: Flat-Feet 時(shí)間: 2025-3-27 02:02 作者: 確認(rèn) 時(shí)間: 2025-3-27 07:32
https://doi.org/10.1007/978-3-319-29516-9approximation algorithms; combinatorics; data structures; distributed algorithms; graph theory; algorithm作者: 凝結(jié)劑 時(shí)間: 2025-3-27 10:35
978-3-319-29515-2Springer International Publishing Switzerland 2016作者: ingestion 時(shí)間: 2025-3-27 17:29
D. Dijkstra,H. Schippers,P. J. ZandbergenThe .-free order is a linear order of the vertices of a graph the existence of which characterizes .-free graphs. We show that all .-free orders of an .-free graph can be generated in .(1) amortized time.作者: 名次后綴 時(shí)間: 2025-3-27 19:16 作者: 善變 時(shí)間: 2025-3-28 01:37
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width,constant-size subset of the non-negative real numbers, and the goal is to find activation values . for all . of minimum total cost . such that the activated set of edges satisfies some connectivity requirements. We propose an algorithm that optimally solves the .?.?.?.. (.-MAEDP) problem in . time for graphs with treewidth bounded by a constant ..作者: CURB 時(shí)間: 2025-3-28 05:11 作者: 牌帶來 時(shí)間: 2025-3-28 09:52
List Colouring and Partial List Colouring of Graphs On-line,model introduced by Schauz?[.] and Zhu?[.]. We prove that the on-line version of Ohba’s conjecture is true for the class of planar graphs. We show that the conjecture for partial list colouring on-line holds for several graph classes, namely claw-free graphs, maximal planar graphs, series-parallel graphs, and chordal graphs.作者: Ledger 時(shí)間: 2025-3-28 14:17
,Schr?der Partitions and Schr?der Tableaux,ome properties of the partial order given by containment of Schr?der shapes. Then we propose an algorithm which is the natural analog of the well known RS correspondence for Young tableaux, and we characterize those permutations whose insertion tableaux have some special shapes. We end our paper with a few suggestions for possible further work.作者: 輕彈 時(shí)間: 2025-3-28 15:17
Masahiro Notoya,Akinori Miyashitan type of scheme that uses only local degree knowledge. This biases the transitions of the walk towards lower degree vertices. We demonstrate that, with high probability, the cover time is at most ., where . is the minimum degree. This is in contrast to the precise cover time of . (with high probabi作者: interrupt 時(shí)間: 2025-3-28 19:01
A. Candia,S. Lindstrom,E. Reyesconstant-size subset of the non-negative real numbers, and the goal is to find activation values . for all . of minimum total cost . such that the activated set of edges satisfies some connectivity requirements. We propose an algorithm that optimally solves the .?.?.?.. (.-MAEDP) problem in . time f作者: 易于出錯(cuò) 時(shí)間: 2025-3-28 22:59
A. Candia,S. Lindstrom,E. Reyestriangles, then . is called .. Polyhedrally, triangle-free 2-matchings are harder than 2-matchings, but easier than usual 1-matchings..Concerning the weighted case, Cornuéjols and Pulleyblank devised a combinatorial strongly-polynomial algorithm that finds a perfect triangle-free 2-matching of minim作者: 變色龍 時(shí)間: 2025-3-29 06:30 作者: 挑剔為人 時(shí)間: 2025-3-29 10:57 作者: Lipohypertrophy 時(shí)間: 2025-3-29 14:09 作者: cylinder 時(shí)間: 2025-3-29 17:30
O. M. Belotserkovskii,A. S. Kholodovion to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set; it is cyclic otherwise. As far as we know, only the enumeration of acyclic orientations has been addressed in the literature. In this paper, we pose the problem of efficiently enumerating all the . orientations作者: 填滿 時(shí)間: 2025-3-29 22:18 作者: configuration 時(shí)間: 2025-3-30 03:11 作者: 陳列 時(shí)間: 2025-3-30 04:47 作者: 浸軟 時(shí)間: 2025-3-30 11:04
A New View on the Uncertainty Principle,robots operate in asynchronous cycles. In one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to move to one of its neighbors (Compute), and in the latter case makes the computed move (Move). Cycles are performed asynchronously for each robot. The作者: inflate 時(shí)間: 2025-3-30 16:06 作者: 賞心悅目 時(shí)間: 2025-3-30 18:33 作者: Mere僅僅 時(shí)間: 2025-3-30 22:48 作者: fiscal 時(shí)間: 2025-3-31 02:42
M. Stefan,S. V. Nistor,D. Ghicaivated vertices or if at some point it had at least?. active neighbors, for a threshold?. that is identical for all vertices. A contagious set is a vertex set whose activation results with the entire graph being active. Let .(.,?.) be the size of a smallest contagious set in a graph .. We examine de作者: 勤勉 時(shí)間: 2025-3-31 08:02
https://doi.org/10.1007/978-3-662-44479-5arising from model validation in the study of phylogenetic networks. It asks to determine whether or not a given network displays a given phylogenetic tree over the same leaf set. It is known to be .-complete in general. Whether or not it remains .-complete for stable networks is an open problem. We作者: Shuttle 時(shí)間: 2025-3-31 11:20
M. Stefan,S. V. Nistor,D. Ghicais the minimum number of colors needed to make . rainbow connected. Along with its variants, which consider vertex colorings and/or so-called strong colorings, the rainbow connection number has been studied from both the algorithmic and graph-theoretic points of view..In this paper we present a rang作者: 航海太平洋 時(shí)間: 2025-3-31 14:27 作者: faction 時(shí)間: 2025-3-31 20:07
About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings,ven and nine nodes. We present an exhaustive proof about the impossibility of designing a strategy that solves the gathering in the considered setting. The proof makes use of both theoretical and computer-assisted approaches. Despite the specific cases considered, the relevance of the provided proof作者: syncope 時(shí)間: 2025-4-1 00:40
On the Complexity of Rainbow Coloring Problems,nbow coloring by saving a fixed number of colors from a trivial upper bound. Finally, we give a linear-time algorithm for computing the exact rainbow connection numbers for three variants of the problem on graphs of bounded vertex cover number.作者: Lipohypertrophy 時(shí)間: 2025-4-1 03:04 作者: 吞下 時(shí)間: 2025-4-1 07:35
0302-9743 ormation retrieval; cryptography and information security;decompositions and combinatorial designs; discrete and computational geometry;graph drawing and labeling; graph theory...?.978-3-319-29515-2978-3-319-29516-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
