書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度學科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學科排名
作者: 易受騙 時間: 2025-3-21 21:21 作者: 偽善 時間: 2025-3-22 01:11
Graph-Theoretic Concepts in Computer Science978-3-540-36379-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Brittle 時間: 2025-3-22 06:51
https://doi.org/10.1007/978-3-030-82786-1A tree . . is . for the class of trees if for every tree . of size ., . can be obtained from . . by successive contractions of edges.We prove that a m-universal tree for the class of trees has at least .ln(.)+(γ-1).+.(1) edges where γ is the Euler’s constant and we build such a tree with less than . . edges for a fixed constant . = 1.984 . . .作者: anatomical 時間: 2025-3-22 09:41 作者: GAVEL 時間: 2025-3-22 15:26
https://doi.org/10.1007/978-3-642-25218-1We present a new general 3-color criterion for planar graphs. Applying this criterion we characterize a broad class of 3-colorable planar graphs and provide a corresponding linear time 3-coloring algorithm. We also characterize fully infinite 3-colorable planar triangulations.作者: GAVEL 時間: 2025-3-22 20:03
On the Minimum Size of a Contraction-Universal Tree,A tree . . is . for the class of trees if for every tree . of size ., . can be obtained from . . by successive contractions of edges.We prove that a m-universal tree for the class of trees has at least .ln(.)+(γ-1).+.(1) edges where γ is the Euler’s constant and we build such a tree with less than . . edges for a fixed constant . = 1.984 . . .作者: 著名 時間: 2025-3-22 23:41
Optimal Area Algorithm for Planar Polyline Drawings,We present a linear time algorithm based on Schnyder trees that produces planar polyline drawings. These drawings have the optimal area (4(.-1)./9) and width (?2(.-1)/3?), and have at most .-2 bends, where . is the number of vertices of the graph. Moreover, at most one bend per edge is needed.作者: 極端的正確性 時間: 2025-3-23 05:19
A New 3-Color Criterion for Planar Graphs,We present a new general 3-color criterion for planar graphs. Applying this criterion we characterize a broad class of 3-colorable planar graphs and provide a corresponding linear time 3-coloring algorithm. We also characterize fully infinite 3-colorable planar triangulations.作者: HERE 時間: 2025-3-23 09:25 作者: 畢業(yè)典禮 時間: 2025-3-23 11:09
https://doi.org/10.1007/978-1-349-21161-6r . together with a set . of words of length . over the four symbols .. The problem is to decide whether there exists a word of length . that contains every word in S at least once as a subword, and does not contain any other subword of length .. The computational complexity of this problem has been作者: deactivate 時間: 2025-3-23 17:44 作者: choroid 時間: 2025-3-23 19:33 作者: Blood-Vessels 時間: 2025-3-23 22:33
https://doi.org/10.1007/978-3-030-54352-5binatorics, the algorithmics, and the complexity of subcolorings..On the negative side, we prove that 2-subcoloring is NP-hard for comparability graphs, and that 3-subcoloring is NP-hard for AT-free graphs and for complements of planar graphs. On the positive side, we derive polynomial time algorith作者: 抗體 時間: 2025-3-24 04:47 作者: 避開 時間: 2025-3-24 10:18 作者: Osteoporosis 時間: 2025-3-24 12:18 作者: 認識 時間: 2025-3-24 18:24
https://doi.org/10.1007/978-3-030-76267-4 of a stable set . of . is .(.) = max.(υ) : υ ∈ . ∩ .. A .-coloring . = (. ., . . . , . .) of . is a partition of . into . stable sets . ., . . . , . . and the weight of . is .(. .) + . . . + .(. .). The objective then is to find a coloring . = (. ., . . . , . .) of . such that .(. .) + . . . + .(. 作者: 口訣 時間: 2025-3-24 22:16 作者: negligence 時間: 2025-3-25 01:43
https://doi.org/10.1007/978-3-030-37417-4imum clique size ., a routing scheme using routing tables of .(. log .) bits per node and .(log .) bit addresses such that the length of the route between any two nodes is at most the distance between the nodes in the graph plus two. This is complemented by a recent lower bound that shows that if th作者: 飛行員 時間: 2025-3-25 05:38
https://doi.org/10.1007/978-981-99-5720-0ed variant of treewidth, motivated by the analysis of algorithms for probabilistic networks. We present two general reduction rules that are safe for weighted treewidth, which generalise many of the existing reduction rules for treewidth. Experimental results show that these reduction rules can sign作者: Ferritin 時間: 2025-3-25 10:57
https://doi.org/10.34156/978-3-7910-6225-9ion [.], showing how a more elaborated use of these theorems can bring down the algorithmically relevant constants. More precisely, if a .-algorithm is obtainable with the help of applying the well-known Lipton/Tarjan planar separator theorem, our new approach will lead to a .-algorithm, this way al作者: FANG 時間: 2025-3-25 14:37
https://doi.org/10.1007/b101202as .-covering. An .-cover of a graph . is a local isomorphism between . and ., and the complexity of deciding if an input graph . has an .-cover is still open for many graphs .. In this paper we show that the complexity of .(2., .)-COLORING is directly related to these open graph covering problems, 作者: Overdose 時間: 2025-3-25 17:50 作者: Glossy 時間: 2025-3-25 20:06 作者: Anhydrous 時間: 2025-3-26 02:16
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem,r . together with a set . of words of length . over the four symbols .. The problem is to decide whether there exists a word of length . that contains every word in S at least once as a subword, and does not contain any other subword of length .. The computational complexity of this problem has been作者: Anemia 時間: 2025-3-26 06:31 作者: CUB 時間: 2025-3-26 11:21 作者: SLAY 時間: 2025-3-26 15:42 作者: Indelible 時間: 2025-3-26 18:33
Search in Indecomposable Graphs, these properties. Endly we will see that using this search, when the vertices of an indecomposable graph G are visited in a given order ., the vertices of the complement of . (denoted .) can also be visited in the same order ..作者: 弄臟 時間: 2025-3-27 00:29 作者: 執(zhí)拗 時間: 2025-3-27 02:58
Algorithms and Models for the On-Line Vertex-Covering,the final solution dealing with this step. We first study the minimum vertex-covering problem under two on-line models corresponding to two different ways vertices are revealed. The former one implies that the input-graph is revealed vertex-by-vertex. The second model implies that the input-graph is作者: 六個才偏離 時間: 2025-3-27 08:03
Weighted Node Coloring: When Stable Sets Are Expensive, of a stable set . of . is .(.) = max.(υ) : υ ∈ . ∩ .. A .-coloring . = (. ., . . . , . .) of . is a partition of . into . stable sets . ., . . . , . . and the weight of . is .(. .) + . . . + .(. .). The objective then is to find a coloring . = (. ., . . . , . .) of . such that .(. .) + . . . + .(. 作者: Notorious 時間: 2025-3-27 11:07
The Complexity of Restrictive ,-Coloring,ider the decision and the counting version of the problem; namely the . . and the . #. problems. We provide a dichotomy theorem characterizing the .‘s for which the restrictive .-coloring problem is either NP-complete or polynomially solvable. Moreover, we prove that the same criterion discriminates作者: encomiast 時間: 2025-3-27 13:49
An Additive Stretched Routing Scheme for Chordal Graphs,imum clique size ., a routing scheme using routing tables of .(. log .) bits per node and .(log .) bit addresses such that the length of the route between any two nodes is at most the distance between the nodes in the graph plus two. This is complemented by a recent lower bound that shows that if th作者: gratify 時間: 2025-3-27 20:00 作者: Nonporous 時間: 2025-3-28 00:26 作者: harpsichord 時間: 2025-3-28 04:53 作者: 命令變成大炮 時間: 2025-3-28 07:11
The Complexity of Approximating the Oriented Diameter of Chordal Graphs,orithmic aspects of determining the oriented diameter of a chordal graph. We — give a linear time algorithm such that, for a given chordal graph ., either concludes that there is no strongly connected orientation of ., or finds a strongly connected orientation of . with diameter at most twice the di作者: 惡臭 時間: 2025-3-28 13:10 作者: CHYME 時間: 2025-3-28 15:40 作者: Harbor 時間: 2025-3-28 19:53
Maximum Cardinality Search for Computing Minimal Triangulations,hat also computes a minimal triangulation of an arbitrary graph. MCS simplified the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new simpler algorithm MCS-M combines the extension of Lex-M with the simplification of MCS, achieving all the results of Lex-M in the same time complexity.作者: byline 時間: 2025-3-29 02:10
The Complexity of Restrictive ,-Coloring, for which the restrictive .-coloring problem is either NP-complete or polynomially solvable. Moreover, we prove that the same criterion discriminates the #P-complete and the polynomially solvable cases of the . #itH-coloring problem. Finally, we prove that both results apply also to the list versions of the above problems.作者: Living-Will 時間: 2025-3-29 03:27 作者: Genistein 時間: 2025-3-29 07:59 作者: Obloquy 時間: 2025-3-29 12:33
Graph Separator Algorithms: A Refined Analysis,s obtainable with the help of applying the well-known Lipton/Tarjan planar separator theorem, our new approach will lead to a .-algorithm, this way also improving on the direct use of the “best” known planar separator theorem. For several problems, the constants can be even improved more by analyzing other separator theorems.作者: larder 時間: 2025-3-29 17:11
Generalized ,-Coloring and ,-Covering of Trees,ill open for many graphs .. In this paper we show that the complexity of .(2., .)-COLORING is directly related to these open graph covering problems, and answer some of them by resolving the complexity of .-COLORING for all acyclic graphs . and all values of . and ..作者: PALL 時間: 2025-3-29 20:11
https://doi.org/10.1007/978-1-349-21161-6 open for some time, and it remains open. What we prove is that this problem is polynomial time equivalent to the exact perfect matching problem in bipartite graphs, which is another infamous combinatorial optimization problem of unknown computational complexity.作者: convert 時間: 2025-3-30 03:09
Modern Solid State Fermentationidth since bounded treewidth implies bounded clique-width..We give a complete classification of all graph classes defined by forbidden one-vertex extensions of the . . with respect to their clique-width. Our results extend and improve recently published structural and complexity results in a systematic way.作者: 睨視 時間: 2025-3-30 06:54 作者: Pcos971 時間: 2025-3-30 10:26
Modern Stereotactic Neurosurgeryaph Sandwich Problem as follows: the problem is NP-complete, if k+l > 2; the problem is polynomial otherwise. In addition, we consider the degree Δ constraint subproblem and completely classifies the problem as follows: the problem is polynomial, for k ≤2 or ?≤3; the problem is .-complete otherwise.作者: inscribe 時間: 2025-3-30 15:29
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem, open for some time, and it remains open. What we prove is that this problem is polynomial time equivalent to the exact perfect matching problem in bipartite graphs, which is another infamous combinatorial optimization problem of unknown computational complexity.作者: 缺陷 時間: 2025-3-30 16:44 作者: 枕墊 時間: 2025-3-30 22:40
More about Subcolorings,ms for 2-subcoloring of complements of planar graphs, and for .-subcoloring of interval and of permutation graphs. Moreover, we prove asymptotically best possible upper bounds on the subchromatic number of interval graphs, chordal graphs, and permutation graphs in terms of the number of vertices.作者: 向下 時間: 2025-3-31 01:15
On the Complexity of (,)-Graph Sandwich Problems,aph Sandwich Problem as follows: the problem is NP-complete, if k+l > 2; the problem is polynomial otherwise. In addition, we consider the degree Δ constraint subproblem and completely classifies the problem as follows: the problem is polynomial, for k ≤2 or ?≤3; the problem is .-complete otherwise.作者: Ophthalmoscope 時間: 2025-3-31 05:50 作者: 濕潤 時間: 2025-3-31 11:49
Ton J. Cleophas,Aeilko H. Zwinderman for which the restrictive .-coloring problem is either NP-complete or polynomially solvable. Moreover, we prove that the same criterion discriminates the #P-complete and the polynomially solvable cases of the . #itH-coloring problem. Finally, we prove that both results apply also to the list versions of the above problems.作者: Blazon 時間: 2025-3-31 16:13
https://doi.org/10.1007/978-3-030-37417-4ween any two nodes is at most the distance between the nodes in the graph plus two. This is complemented by a recent lower bound that shows that if the shortest paths and .(log .) bit addresses are required, every routing strategy for this class needs .(2. log(./2.)) bits per node.作者: 百科全書 時間: 2025-3-31 19:44
https://doi.org/10.1007/978-981-99-5720-0weighted treewidth, which generalise many of the existing reduction rules for treewidth. Experimental results show that these reduction rules can significantly reduce the problem size for several instances of real-life probabilistic networks.作者: Accord 時間: 2025-3-31 21:50
https://doi.org/10.34156/978-3-7910-6225-9s obtainable with the help of applying the well-known Lipton/Tarjan planar separator theorem, our new approach will lead to a .-algorithm, this way also improving on the direct use of the “best” known planar separator theorem. For several problems, the constants can be even improved more by analyzing other separator theorems.作者: anachronistic 時間: 2025-4-1 04:28 作者: freight 時間: 2025-4-1 09:52 作者: CRUC 時間: 2025-4-1 12:13
Modern Techniques in High-Resolution FT-NMRlled split graphs; — show that unless . = ., there is neither a polynomial-time absolute approximation algorithm nor an α-approximation (for every α< 3/2 ) algorithm computing oriented diameter of a chordal graph.作者: 向前變橢圓 時間: 2025-4-1 16:51 作者: 性別 時間: 2025-4-1 21:12
