書目名稱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 20:40 作者: chastise 時間: 2025-3-22 00:57 作者: 必死 時間: 2025-3-22 06:25 作者: 無辜 時間: 2025-3-22 11:16
A Graph Polynomial Arising from Community Structure (Extended Abstract),nts the number of connected components in induced subgraphs. We analyze the features of the new polynomial. First, we re-define it as a subset expansion formula. Second, we give a recursive definition of . using vertex deletion, vertex contraction and deletion of a vertex together with its neighborh作者: 不能妥協(xié) 時間: 2025-3-22 13:56
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs, an exact algorithm that solves it in ..(..) time for some constant .
作者: 不能妥協(xié) 時間: 2025-3-22 20:02 作者: 賄賂 時間: 2025-3-22 22:11 作者: jeopardize 時間: 2025-3-23 03:08 作者: enmesh 時間: 2025-3-23 09:29 作者: Aerophagia 時間: 2025-3-23 16:04 作者: integral 時間: 2025-3-23 20:56
Parameterized Complexity of Generalized Domination Problems,or every .???.. This concept, introduced by Telle in 1990’s, generalizes and unifies several variants of graph domination studied separately before. We study the parameterized complexity of (.,.)-domination in this general setting. Among other results we show that existence of a (.,.)-dominating set作者: 使顯得不重要 時間: 2025-3-24 00:44 作者: 憤世嫉俗者 時間: 2025-3-24 05:38 作者: aneurysm 時間: 2025-3-24 07:38 作者: notice 時間: 2025-3-24 12:47 作者: 火光在搖曳 時間: 2025-3-24 18:17
Local Algorithms for Edge Colorings in UDGs,sor networks as they can be used to model link scheduling problems in such networks. It is well known that both problems are NP-complete, and approximation algorithms for them have been extensively studied under the centralized model of computation. Centralized algorithms, however, are not suitable 作者: 陰郁 時間: 2025-3-24 19:06 作者: 詩集 時間: 2025-3-24 23:39
https://doi.org/10.1007/978-1-349-05843-3performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm depends on the special properties of the graph constructed in this way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, rectilinear cartogram construction, mesh stripificat作者: Malleable 時間: 2025-3-25 05:25 作者: SEVER 時間: 2025-3-25 11:24 作者: 祖?zhèn)髫敭a(chǎn) 時間: 2025-3-25 14:08 作者: Modify 時間: 2025-3-25 19:24 作者: Preserve 時間: 2025-3-25 20:48
https://doi.org/10.1057/9780230290679 . of degree . are .. In certain contexts it is necessary to maintain a directed spanning tree of ., in which case each node needs to remember the port number leading to its parent. Hence the cost of a spanning tree . is the total number of bits the nodes need to store in order to remember .. This p作者: Feature 時間: 2025-3-26 01:43
Modern Problems of Molecular Physics-tree of its maximal cliques, and its modular decomposition. After each vertex or edge modification (insertion or deletion), the algorithm determines whether the new graph is an interval graph in .(.) time, and, in the positive, updates the three representations within the same complexity.作者: creditor 時間: 2025-3-26 04:32
https://doi.org/10.1007/978-1-4684-8592-9a property Π, and we are asked to find a subset of edges satisfying property Π that uses the minimum number of labels. These problems have a lot of applications in networking. We show that all the problems under consideration are W[2]-hard when parameterized by the number of used labels, and that th作者: Arthritis 時間: 2025-3-26 11:31
https://doi.org/10.1007/978-3-642-76401-1 problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form ..(..) (.?≤?3). The main result, however, is a branching algorithm for graphs with maximum degree three. It only needs polynomial space and has a running time of .(1.8669.) when analyzed作者: 四海為家的人 時間: 2025-3-26 12:44
https://doi.org/10.1007/978-1-4842-2490-8be used as “subroutines” for other combinatorial optimization problems. In the sub-coloring problem, given a graph ., we want to partition the vertices of . into minimum number of sub-color classes, where each sub-color class induces a union of disjoint cliques in .. In the hypo-coloring problem, gi作者: Encephalitis 時間: 2025-3-26 19:02
Mathematics and Its Applicationsor every .???.. This concept, introduced by Telle in 1990’s, generalizes and unifies several variants of graph domination studied separately before. We study the parameterized complexity of (.,.)-domination in this general setting. Among other results we show that existence of a (.,.)-dominating set作者: 點燃 時間: 2025-3-26 21:53
https://doi.org/10.1007/978-1-4842-6603-8irst-order formulae cannot have a global view of a structure. This limitation ensures their low sequential computational complexity. We show that the locality impacts as well on their distributed computational complexity. We use first-order formulae to describe the properties of finite connected gra作者: 共同確定為確 時間: 2025-3-27 01:39 作者: Creatinine-Test 時間: 2025-3-27 09:20 作者: 咒語 時間: 2025-3-27 11:25 作者: OASIS 時間: 2025-3-27 17:07 作者: 基因組 時間: 2025-3-27 20:30
https://doi.org/10.1057/9780230625198duced prime graphs with respect to . and an undirected graph has rank-width at most 1 if and only if it is a distance-hereditary graph. We are interested in an extension of these results to directed graphs. We give several characterizations of directed graphs of rank-width 1 and we prove that the ra作者: pulmonary 時間: 2025-3-28 01:10 作者: incite 時間: 2025-3-28 04:26
https://doi.org/10.1007/978-3-642-76401-1 with respect to the number of vertices. We also show that its running time is 2.1364... when the goal is to find a spanning tree with at least . internal vertices. Both running time bounds are obtained via a Measure & Conquer analysis, the latter one being a novel use of this kind of analysis for parameterized algorithms.作者: nettle 時間: 2025-3-28 09:15
Mathematics and Its Applications of size . (and at most .) are W[1]-complete problems (when parameterized by .) for any pair of finite sets . and .. We further present results on dual parametrization by .???., and results on certain infinite sets (in particular for ., . being the sets of even and odd integers).作者: 亞麻制品 時間: 2025-3-28 10:40 作者: conjunctiva 時間: 2025-3-28 17:32 作者: 異端 時間: 2025-3-28 21:11
Exact and Parameterized Algorithms for ,, with respect to the number of vertices. We also show that its running time is 2.1364... when the goal is to find a spanning tree with at least . internal vertices. Both running time bounds are obtained via a Measure & Conquer analysis, the latter one being a novel use of this kind of analysis for parameterized algorithms.作者: Charlatan 時間: 2025-3-28 23:54
Parameterized Complexity of Generalized Domination Problems, of size . (and at most .) are W[1]-complete problems (when parameterized by .) for any pair of finite sets . and .. We further present results on dual parametrization by .???., and results on certain infinite sets (in particular for ., . being the sets of even and odd integers).作者: characteristic 時間: 2025-3-29 04:12
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees,ath-maxima problem implies a linear-time algorithm for the . problem of determining whether a given spanning tree of a given undirected graph . with real edge weights is a minimum-weight spanning tree of?..作者: 闡明 時間: 2025-3-29 09:23 作者: 永久 時間: 2025-3-29 12:28
https://doi.org/10.1007/978-1-4842-6603-8 and planar networks, first-order properties can be frugally evaluated, that is, with only a bounded number of messages, of size logarithmic in the number of nodes, sent over each link. Moreover, we show that the result carries over for the extension of first-order logic with unary counting.作者: Pigeon 時間: 2025-3-29 15:32 作者: Blatant 時間: 2025-3-29 21:38 作者: 乞丐 時間: 2025-3-30 00:07 作者: 騙子 時間: 2025-3-30 07:09 作者: nominal 時間: 2025-3-30 11:29
On Module-Composed Graphs,case of bipartite graphs, we show that the set of module-composed graphs is equivalent to the well known class of distance hereditary graphs, which implies linear time algorithms for their recognition and construction of a corresponding module-sequence using BFS and Lex-BFS.作者: 哪有黃油 時間: 2025-3-30 13:21 作者: sulcus 時間: 2025-3-30 20:12
https://doi.org/10.1007/978-0-387-72853-7ls, and the bivariate extension of the chromatic polynomial introduced by K.?Dohmen, A.?P?nitz, and P.?Tittmann (2003). Finally we show that the computation of . is .-hard, but Fixed Parameter Tractable for graphs of bounded tree-width and clique-width.作者: Nomadic 時間: 2025-3-30 22:07
https://doi.org/10.1007/978-1-4684-8592-9edge dominating set that uses the minimum number of labels, is FPT when parameterized by the solution size. Proving that some of these problems are FPT is nontrivial, and requires interesting and elegant algorithmic methods that we develop in this paper.作者: Magnificent 時間: 2025-3-31 02:20
https://doi.org/10.1007/978-1-4842-2490-8er . and use this to derive a 3-approximation algorithm for sub-coloring interval graphs. For the hypo-coloring problem on interval graphs, we first show that it is NP-complete, and then via reduction to the max-coloring problem, show how to obtain an .(log.)-approximation algorithm for it.作者: hysterectomy 時間: 2025-3-31 08:16 作者: 絕緣 時間: 2025-3-31 09:29
The Parameterized Complexity of Some Minimum Label Problems,edge dominating set that uses the minimum number of labels, is FPT when parameterized by the solution size. Proving that some of these problems are FPT is nontrivial, and requires interesting and elegant algorithmic methods that we develop in this paper.作者: ELUC 時間: 2025-3-31 14:16 作者: kyphoplasty 時間: 2025-3-31 18:32
https://doi.org/10.1007/978-1-349-05843-3s way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, rectilinear cartogram construction, mesh stripification, angle optimization in tilings, and metric embedding from this perspective.作者: 脆弱帶來 時間: 2025-3-31 23:40
https://doi.org/10.1057/9780230625198ted in an extension of these results to directed graphs. We give several characterizations of directed graphs of rank-width 1 and we prove that the rank-width of a directed graph is the maximum over all induced prime graphs with respect to ., a new decomposition on directed graphs.作者: 不可知論 時間: 2025-4-1 04:05 作者: Atrium 時間: 2025-4-1 08:45
Directed Rank-Width and Displit Decomposition,ted in an extension of these results to directed graphs. We give several characterizations of directed graphs of rank-width 1 and we prove that the rank-width of a directed graph is the maximum over all induced prime graphs with respect to ., a new decomposition on directed graphs.作者: Traumatic-Grief 時間: 2025-4-1 13:54
https://doi.org/10.1007/978-1-4842-5569-8Let . be an unweighted graph on . vertices. We show that an embedding of the shortest path metric of . into the line with minimum distortion can be found in time 5.. This is the first algorithm breaking the trivial .!-barrier.作者: 小臼 時間: 2025-4-1 18:24 作者: faction 時間: 2025-4-1 20:48 作者: 劇毒 時間: 2025-4-2 01:42 作者: 滲透 時間: 2025-4-2 03:03
