書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: 容易懂得 時間: 2025-3-21 22:57 作者: HERTZ 時間: 2025-3-22 00:44
https://doi.org/10.1007/978-3-658-43269-0igate both from theoretical and practical angles. We propose several algorithms to tackle these problems and report on extensive experiments. At the time of writing, a large gap remains between the best lower and upper bounds for the minimum size of KS vector systems.作者: 廢除 時間: 2025-3-22 08:16
Moderne Verfahren der Angewandten Statistiko describe all graphs having a planar cover. Kratochvíl asked whether there are non-trivial graphs for which .(.) is .-complete but .(.) belongs to ...We examine the first nontrivial cases of graphs . for which .(.) is .-complete and which admit a planar cover. We prove .-completeness of .(.) in these cases.作者: LAPSE 時間: 2025-3-22 09:58
Moderne Verfahren der Kryptographie?.?≤?2.???1 and polynomial time solvable otherwise). The one for planar graphs proves the NP-hardness of colouring with less than 7 colours graphs of thickness two and less than 6.???3 colours graphs of thickness .?≥?3.作者: Ischemic-Stroke 時間: 2025-3-22 14:08 作者: Ischemic-Stroke 時間: 2025-3-22 21:01 作者: 有說服力 時間: 2025-3-23 00:07
On the Complexity of Planar Covering of Small Graphs,o describe all graphs having a planar cover. Kratochvíl asked whether there are non-trivial graphs for which .(.) is .-complete but .(.) belongs to ...We examine the first nontrivial cases of graphs . for which .(.) is .-complete and which admit a planar cover. We prove .-completeness of .(.) in these cases.作者: 極大的痛苦 時間: 2025-3-23 03:19
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem,?.?≤?2.???1 and polynomial time solvable otherwise). The one for planar graphs proves the NP-hardness of colouring with less than 7 colours graphs of thickness two and less than 6.???3 colours graphs of thickness .?≥?3.作者: mendacity 時間: 2025-3-23 06:41
Alternation Graphs,sentation of the graph. A graph . is a . graph if it is represented by a word in which each letter occurs exactly . times; the alternation number of . is the minimum . for which . is a .-alternation graph. We show that the alternation number is always at most ., while there exist graphs for which it is ./2.作者: 統(tǒng)治人類 時間: 2025-3-23 10:11 作者: Pepsin 時間: 2025-3-23 17:24 作者: 流出 時間: 2025-3-23 20:33
The Cinderella Game on Holes and Anti-holes,inderella can win the game..We determine the bucket numbers of all perfect graphs, and we also derive results on the bucket numbers of certain non-perfect graphs. In particular, we analyze the game on holes and (partially) on anti-holes for the cases where Cinderella sticks to a simple greedy strategy.作者: Matrimony 時間: 2025-3-24 01:07 作者: HEDGE 時間: 2025-3-24 02:41
https://doi.org/10.1007/978-3-642-81506-5circular arc graphs, circular .-trapezoid graphs, convex graphs, Dilworth . graphs, .-polygon graphs and complements of .-degenerate graphs. Combined with results in [1,5], this implies that a large class of vertex subset and vertex partitioning problems can be solved in polynomial time on these graph classes.作者: limber 時間: 2025-3-24 10:08 作者: TOXIC 時間: 2025-3-24 14:15
Moderne Verfahren der Kryptographiewith no induced .. We also show that ... is fixed parameter tractable in .?+?. on graphs with no induced ..?+?.., and that .-. restricted to such graphs allows a polynomial kernel when parameterized by .. Finally, we show that ... is fixed parameter tractable in . for graphs with no induced ..?+?...作者: 盡忠 時間: 2025-3-24 16:33
https://doi.org/10.1007/978-3-322-84306-7overy. In these inverse problems, the goal is to generate chemical compounds having desired structural properties, as there is a strong correlation between structural properties, such as the Wiener index, which is closely connected to the considered problem, and biological activity.作者: 細頸瓶 時間: 2025-3-24 19:51 作者: ineptitude 時間: 2025-3-24 23:46 作者: reflection 時間: 2025-3-25 06:08
List Coloring in the Absence of a Linear Forest,with no induced .. We also show that ... is fixed parameter tractable in .?+?. on graphs with no induced ..?+?.., and that .-. restricted to such graphs allows a polynomial kernel when parameterized by .. Finally, we show that ... is fixed parameter tractable in . for graphs with no induced ..?+?...作者: ANTI 時間: 2025-3-25 10:40 作者: ANN 時間: 2025-3-25 14:07
Structures and Hyperstructures in Metabolic Networks,idered as chemical factories that manufacture the various products of the cells and the metabolic capacities of an organism are directly defined by the set of its possible biochemical reactions. The links between reactions and compounds (or metabolites) that are used and produced by such reactions c作者: penance 時間: 2025-3-25 16:14
Important Separators and Parameterized Algorithms,ter tractable algorithms for multi(way) cut problems. For example, the recent breakthrough result of Chen et al.[3] on the . problem can be also explained using this notion. In my talk, I will overview combinatorial and algorithmic results that can be obtained by studying such separators.作者: fluffy 時間: 2025-3-25 19:58
Split Clique Graph Complexity,(.), is the intersection graph of .. Say that . is . if there exists a graph . such that .?=?.(.). The clique graph recognition problem, a long-standing open question posed in 1971, asks whether a given graph is a clique graph and it was recently proved to be NP-complete even for a graph . with maxi作者: hermitage 時間: 2025-3-26 03:37
On Searching for Small Kochen-Specker Vector Systems,that no two orthogonal vectors are assigned 0 and no three mutually orthogonal vectors are assigned 1. The existence of such sets forms the basis of the Kochen-Specker and Free Will theorems. Currently, the smallest known KS vector system contains 31 vectors. In this paper, we establish a lower boun作者: 愛社交 時間: 2025-3-26 06:04 作者: 空氣 時間: 2025-3-26 10:25 作者: Glaci冰 時間: 2025-3-26 16:36
Exact Algorithms for Kayles,lready chosen vertex. The last player that can select a vertex wins the game. In this paper, we give an exact algorithm to determine which player has a winning strategy in this game. To analyse the running time of the algorithm, we introduce the notion of a K-set: a nonempty set of vertices .???. is作者: refraction 時間: 2025-3-26 19:08
The Cinderella Game on Holes and Anti-holes,as the other player (the wicked Stepmother) wants to cause overflows. The bucket number of a graph . is the smallest possible bucket size with which Cinderella can win the game..We determine the bucket numbers of all perfect graphs, and we also derive results on the bucket numbers of certain non-per作者: 魔鬼在游行 時間: 2025-3-26 21:35 作者: 無辜 時間: 2025-3-27 01:56
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses,oximation the value sat . was proposed: the maximum number of satisfied agents in the market ., where an agent is said to be satisfied if, given a set of prices, he gets a most preferred house in his budget set. Clearly, market . admits an economic equilibrium if sat(.) is equal to the total number 作者: 表示問 時間: 2025-3-27 08:03 作者: 正常 時間: 2025-3-27 12:04
List Coloring in the Absence of a Linear Forest,roblem requires in addition that every vertex . must receive a color from some given set .(.)???{1,…,.}. Let .. denote the path on . vertices, and .?+?. and . the disjoint union of two graphs . and . and . copies of ., respectively. For any two fixed integers . and ., we show that ... can be solved 作者: prediabetes 時間: 2025-3-27 17:36 作者: 馬籠頭 時間: 2025-3-27 19:57 作者: 助記 時間: 2025-3-28 00:05 作者: 圖表證明 時間: 2025-3-28 06:00 作者: Inelasticity 時間: 2025-3-28 09:54
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem,ve that the problem can be solved in polynomial time using . colours on maps whose underlying adjacency graph has no induced subgraph of average degree larger than ./.. However, if .?≥?3, the problem is NP-hard for forests of paths of arbitrary lengths (if .?
作者: Pelvic-Floor 時間: 2025-3-28 12:08 作者: obsession 時間: 2025-3-28 16:08
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs,?+?1 edge-disjoint ascending paths from . to .. Let .(.,.) denote the minimum number of edges in a .-fault-tolerant gossip graph with . vertices. In this paper, we present upper and lower bounds on .(.,.) which improve the previously known bounds. In particular, from our upper bounds, it follows tha作者: lattice 時間: 2025-3-28 19:17
https://doi.org/10.1007/978-3-662-30220-0idered as chemical factories that manufacture the various products of the cells and the metabolic capacities of an organism are directly defined by the set of its possible biochemical reactions. The links between reactions and compounds (or metabolites) that are used and produced by such reactions c作者: 無法破譯 時間: 2025-3-29 02:27
https://doi.org/10.1007/978-3-662-02064-7ter tractable algorithms for multi(way) cut problems. For example, the recent breakthrough result of Chen et al.[3] on the . problem can be also explained using this notion. In my talk, I will overview combinatorial and algorithmic results that can be obtained by studying such separators.作者: overbearing 時間: 2025-3-29 03:06 作者: 聯(lián)合 時間: 2025-3-29 10:29 作者: macabre 時間: 2025-3-29 14:07
https://doi.org/10.1007/978-3-8349-8818-8removed at their end vertices. Graph layouts characterize interesting classes of planar graphs: A graph?. is a stack graph if and only if . is outerplanar, and a graph is a 2-stack graph if and only if it is a subgraph of a planar graph with a Hamiltonian cycle [2]. Heath and Rosenberg [12] characte作者: HUSH 時間: 2025-3-29 17:22
https://doi.org/10.1007/978-3-642-81506-5 .-. and . are solvable in ..(2.) time [6]. In this paper we study graph classes for which we can compute a decomposition of logarithmic boolean-width in polynomial time. Since 2.?=?.., this gives polynomial time algorithms for the above problems on these graph classes. For interval graphs we show h作者: GENUS 時間: 2025-3-29 23:24 作者: coagulation 時間: 2025-3-30 00:16 作者: 是比賽 時間: 2025-3-30 06:52
Moderne Verfahren der Angewandten Statistikucture of the graphs). Complexity of this problem has been intensively studied. In this paper, we consider the problem .(.) which restricts the input graph . to be planar...(.) is polynomially solvable if .(.) belongs to ., and it is even trivially solvable if . has no planar cover. Thus the interes作者: 無意 時間: 2025-3-30 08:22 作者: sclera 時間: 2025-3-30 12:52 作者: 體貼 時間: 2025-3-30 18:57 作者: innovation 時間: 2025-3-30 21:03 作者: 使人入神 時間: 2025-3-31 02:32
Moderne Verfahren der Kryptographieconnected subgraphs of the infinite two-dimensional grid that do not have holes. Since bisection is an intricate problem, our interest is in the tradeoff between runtime and solution quality that we get by limiting ourselves to a special type of cut, namely cuts with at most one bend each (corner cu作者: Allowance 時間: 2025-3-31 06:17 作者: 愛國者 時間: 2025-3-31 09:50 作者: adroit 時間: 2025-3-31 15:41
Moderne Verfahren der Kryptographieve that the problem can be solved in polynomial time using . colours on maps whose underlying adjacency graph has no induced subgraph of average degree larger than ./.. However, if .?≥?3, the problem is NP-hard for forests of paths of arbitrary lengths (if .?
作者: 擔(dān)憂 時間: 2025-3-31 21:29 作者: 推遲 時間: 2025-4-1 01:23
https://doi.org/10.1007/978-3-662-35163-5?+?1 edge-disjoint ascending paths from . to .. Let .(.,.) denote the minimum number of edges in a .-fault-tolerant gossip graph with . vertices. In this paper, we present upper and lower bounds on .(.,.) which improve the previously known bounds. In particular, from our upper bounds, it follows tha作者: 天空 時間: 2025-4-1 03:44
Graph-Theoretic Concepts in Computer Science978-3-642-25870-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: extinguish 時間: 2025-4-1 08:47
https://doi.org/10.1007/978-3-662-30220-0idered as chemical factories that manufacture the various products of the cells and the metabolic capacities of an organism are directly defined by the set of its possible biochemical reactions. The links between reactions and compounds (or metabolites) that are used and produced by such reactions constitute the . an organism.作者: 火光在搖曳 時間: 2025-4-1 14:02 作者: crescendo 時間: 2025-4-1 15:33
Moderne Verfahren der Kryptographiemplexity of various versions: undirected or directed graphs, vertex or edge deletions, with or without the requirement of connectivity, etc. Of particular interest is a randomized FPT algorithm for making an undirected graph Eulerian by deleting the minimum number of edges.作者: overbearing 時間: 2025-4-1 21:01 作者: Ovulation 時間: 2025-4-1 22:52
Structures and Hyperstructures in Metabolic Networks,idered as chemical factories that manufacture the various products of the cells and the metabolic capacities of an organism are directly defined by the set of its possible biochemical reactions. The links between reactions and compounds (or metabolites) that are used and produced by such reactions constitute the . an organism.
