書(shū)目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書(shū)目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書(shū)目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書(shū)目名稱Graph-Theoretic Concepts in Computer Science年度引用
書(shū)目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書(shū)目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書(shū)目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: 冷淡周邊 時(shí)間: 2025-3-21 23:31
https://doi.org/10.1007/978-3-030-35195-3econd, an explicit one, using a set expansion formula, and finally, a partition function, using counting of weighted graph homomorphisms. We prove the equivalence of the three definitions. Finally, we discuss the complexity of computing .(.,.,.,.).作者: dagger 時(shí)間: 2025-3-22 03:18 作者: foodstuff 時(shí)間: 2025-3-22 05:24
Memory Efficient Anonymous Graph Explorationingle vs multiple agent exploration, as well as in the context of different complexity measures including the time complexity, the memory consumption, and the use of other computational resources such as tokens and messages. In this work the emphasis is on memory efficient exploration of anonymous g作者: chandel 時(shí)間: 2025-3-22 09:55 作者: N斯巴達(dá)人 時(shí)間: 2025-3-22 14:05 作者: N斯巴達(dá)人 時(shí)間: 2025-3-22 20:19
https://doi.org/10.1057/9781137326607mmercial agreements, routing in the Internet must therefore allow each ISP to autonomously set up its own routing policies while ensuring global connectivity. The Border Gateway Protocol (BGP) allows to achieve both these goals, and is the currently adopted protocol for Internet routing..It can be s作者: defray 時(shí)間: 2025-3-22 21:25
https://doi.org/10.1057/9780230250901e from robot navigation in hazardous environments to rigorous searching, indexing and analysing digital data available on the Internet. A large number of exploration algorithms has been proposed under various assumptions about the capability of mobile (exploring) entities and various characteristics作者: AIL 時(shí)間: 2025-3-23 03:31 作者: confederacy 時(shí)間: 2025-3-23 06:58
https://doi.org/10.1007/978-3-030-35195-3on, i.e., deletion of edges together with their end points. Like in the case of deletion and contraction only (J.G. Oxley and D.J.A. Welsh 1979), it turns out that there is a most general polynomial satisfying such recurrence relations, which we call .(.,.,.,.). We show that the new polynomial simul作者: Toxoid-Vaccines 時(shí)間: 2025-3-23 12:39
https://doi.org/10.1007/978-1-349-27058-3f . is defined as .. This value is instrumental to establish the approximability of several .-hard optimization problems definable on ., like for instance the prominent ., which asks for finding a Hamiltonian cycle of . of minimum total cost. In fact, this problem can be approximated quite accuratel作者: MURAL 時(shí)間: 2025-3-23 16:24
https://doi.org/10.1057/9780230610392leak these valves separate the system into a number of pieces limiting the spill effect. In this paper, we consider the problem, for a given edge-weighted network representing a pipe system and for a given number of valves, to place the valves in the network in such a way that the maximum possible s作者: 無(wú)節(jié)奏 時(shí)間: 2025-3-23 20:59 作者: 致命 時(shí)間: 2025-3-24 01:27 作者: EXCEL 時(shí)間: 2025-3-24 06:24 作者: DEAF 時(shí)間: 2025-3-24 09:37
https://doi.org/10.1057/9780230288300n. In 2000, Feige an Kilian [4] came up with a ..(10.)-time algorithm. Since then there has been a growing interest in exponential time algorithms but this bound has not been improved..In this paper we present a new and quite simple ..(5.) algorithm. We also obtain even better bound in some special 作者: CANON 時(shí)間: 2025-3-24 14:07
https://doi.org/10.1007/978-3-030-96241-8hat for any two vertices .,. of . a spanning tree .(.) exists such that the distance in . between . and . is at most . plus their distance in .. In this paper, we examine the problem of finding “small” systems of collective additive tree .-spanners for small values of . on circle graphs and on polyg作者: 滔滔不絕的人 時(shí)間: 2025-3-24 15:11
https://doi.org/10.1057/9780230119666x or in general position. In particular, we show that no biconnected directed graph admits an upward straight-line embedding into every point set in convex position, and we provide a characterization of the Hamiltonian directed graphs that admit upward straight-line embeddings into every point set i作者: apropos 時(shí)間: 2025-3-24 22:59
https://doi.org/10.1057/9781137021885.. We solve an open problem of Goddard et al. and show that the decision whether a tree allows a packing coloring with at most . classes is .-complete..We accompany this .-hardness result by a polynomial time algorithm for trees for closely related variant of the packing coloring problem where the l作者: Debark 時(shí)間: 2025-3-25 01:55 作者: 挑剔為人 時(shí)間: 2025-3-25 07:24
https://doi.org/10.1057/9781137265067n designing algorithms to enumerate all maximal bicliques of a (bipartite) graph. Polynomial-time reductions have been used explicitly or implicitly to design polynomial delay algorithms to enumerate all maximal bicliques..Based on polynomial-time Turing reductions, various algorithmic problems on (作者: 外星人 時(shí)間: 2025-3-25 10:48 作者: 易碎 時(shí)間: 2025-3-25 13:59
Modernist Women Writers and Spiritualityfferent classes of graphs. We explore the boundary between fixed-parameter tractable and W-hard problems on sparse graphs. More precisely, we expand the list of domination problems which are fixed-parameter tractable(FPT) for degenerate graphs by proving that ... and .. are FPT. From the other side 作者: Fissure 時(shí)間: 2025-3-25 17:48 作者: CORD 時(shí)間: 2025-3-25 23:47
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspectivemmercial agreements, routing in the Internet must therefore allow each ISP to autonomously set up its own routing policies while ensuring global connectivity. The Border Gateway Protocol (BGP) allows to achieve both these goals, and is the currently adopted protocol for Internet routing..It can be s作者: 外來(lái) 時(shí)間: 2025-3-26 00:23
Memory Efficient Anonymous Graph Exploratione from robot navigation in hazardous environments to rigorous searching, indexing and analysing digital data available on the Internet. A large number of exploration algorithms has been proposed under various assumptions about the capability of mobile (exploring) entities and various characteristics作者: 使顯得不重要 時(shí)間: 2025-3-26 06:06 作者: 清醒 時(shí)間: 2025-3-26 09:48 作者: 指耕作 時(shí)間: 2025-3-26 15:14 作者: 蕁麻 時(shí)間: 2025-3-26 19:05 作者: 推崇 時(shí)間: 2025-3-26 21:38
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphswhen restricted to cubic graphs, improving on the previous 5/3-approximation for this class. To obtain this approximation we define a graph parameter x(.), and construct a tree with at least (.???x(.)?+?4)/3 leaves, and prove that no tree with more than (.???x(.)?+?2)/2 leaves exists. In contrast to作者: epinephrine 時(shí)間: 2025-3-27 01:51
On the Pseudo-achromatic Number Problem be partitioned into . groups such that every two groups are connected by at least one edge. This problem has been extensively studied in graph theory and combinatorial optimization. We show that the problem has a kernel of at most (.???2)(.?+?1) vertices that is constructable in time ., where . and作者: GLUE 時(shí)間: 2025-3-27 09:16
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings of the graph, such that two nodes surrounded by the same set of roles must be assigned the same role (Borgatti and Everett, 1992). We prove that, for any simple undirected graph . with . distinct neighborhoods and for any integer . with 1?≤?.?≤?., . admits an ecological coloring which uses exactly 作者: 噴出 時(shí)間: 2025-3-27 10:53
Faster Exact Bandwidthn. In 2000, Feige an Kilian [4] came up with a ..(10.)-time algorithm. Since then there has been a growing interest in exponential time algorithms but this bound has not been improved..In this paper we present a new and quite simple ..(5.) algorithm. We also obtain even better bound in some special 作者: AMBI 時(shí)間: 2025-3-27 14:49
Additive Spanners for Circle Graphs and Polygonal Graphshat for any two vertices .,. of . a spanning tree .(.) exists such that the distance in . between . and . is at most . plus their distance in .. In this paper, we examine the problem of finding “small” systems of collective additive tree .-spanners for small values of . on circle graphs and on polyg作者: 江湖騙子 時(shí)間: 2025-3-27 21:37 作者: Mundane 時(shí)間: 2025-3-28 01:49
Complexity of the Packing Coloring Problem for Trees.. We solve an open problem of Goddard et al. and show that the decision whether a tree allows a packing coloring with at most . classes is .-complete..We accompany this .-hardness result by a polynomial time algorithm for trees for closely related variant of the packing coloring problem where the l作者: 宿醉 時(shí)間: 2025-3-28 03:45
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edh. . are common edges between graphs that share the same simple curve in the simultaneous drawing. Determining in polynomial time which pairs of graphs share a simultaneous embedding with fixed edges (.) has been open..We give a necessary and sufficient condition for whether a . exists for pairs of 作者: 使熄滅 時(shí)間: 2025-3-28 07:35 作者: Gentry 時(shí)間: 2025-3-28 11:56
Evaluations of Graph Polynomialsas evaluations at specific points .. In this paper we study the question how to prove that a given graph parameter, say .(.), the size of the maximal clique of ., cannot be a fixed coefficient or the evaluation at any point of the Tutte polynomial, the interlace polynomial, or any graph polynomial o作者: AGOG 時(shí)間: 2025-3-28 14:45
Parameterized Complexity for Domination Problems on Degenerate Graphsfferent classes of graphs. We explore the boundary between fixed-parameter tractable and W-hard problems on sparse graphs. More precisely, we expand the list of domination problems which are fixed-parameter tractable(FPT) for degenerate graphs by proving that ... and .. are FPT. From the other side 作者: 捏造 時(shí)間: 2025-3-28 22:41
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph generating all input-output constrained convex (IOCC) sets in an acyclic digraph, which uses several novel ideas. We show that our algorithm is more efficient than algorithms described in the literature in both the worst case and computational experiments. IOCC sets of acyclic digraphs are of inter作者: Mumble 時(shí)間: 2025-3-29 00:25
https://doi.org/10.1057/9781137035516We show that there exist series-parallel graphs requiring .(. log.) area in any straight-line or poly-line grid drawing. Such a result is achieved by proving that, in any straight-line or poly-line drawing of .., one side of the bounding box has length .(.).作者: osteoclasts 時(shí)間: 2025-3-29 05:08
A Lower Bound on the Area Requirements of Series-Parallel GraphsWe show that there exist series-parallel graphs requiring .(. log.) area in any straight-line or poly-line grid drawing. Such a result is achieved by proving that, in any straight-line or poly-line drawing of .., one side of the bounding box has length .(.).作者: 合同 時(shí)間: 2025-3-29 09:07 作者: Mindfulness 時(shí)間: 2025-3-29 13:11
Faster Exact Bandwidthn. In 2000, Feige an Kilian [4] came up with a ..(10.)-time algorithm. Since then there has been a growing interest in exponential time algorithms but this bound has not been improved..In this paper we present a new and quite simple ..(5.) algorithm. We also obtain even better bound in some special cases.作者: 吼叫 時(shí)間: 2025-3-29 18:18
Graph-Theoretic Concepts in Computer Science978-3-540-92248-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Generator 時(shí)間: 2025-3-29 22:30
https://doi.org/10.1057/9781137021885..We accompany this .-hardness result by a polynomial time algorithm for trees for closely related variant of the packing coloring problem where the lower bounds on the distances between vertices inside color classes are determined by an infinite nondecreasing sequence of bounded integers.作者: 極小 時(shí)間: 2025-3-30 01:17
https://doi.org/10.1007/978-1-349-24551-2efficient than algorithms described in the literature in both the worst case and computational experiments. IOCC sets of acyclic digraphs are of interest in the area of modern embedded processor technology.作者: configuration 時(shí)間: 2025-3-30 04:43
https://doi.org/10.1057/9781137326607and algorithms have been proposed in the literature to study routing oscillations. The goal of this paper is to provide a survey of state of the art contributions in this field with an emphasis on the algorithmic aspects.作者: 調(diào)情 時(shí)間: 2025-3-30 11:42 作者: 劇毒 時(shí)間: 2025-3-30 15:46 作者: 雀斑 時(shí)間: 2025-3-30 18:07
https://doi.org/10.1057/9780230119666ve that for directed trees such embeddings do not always exist. Further, we investigate the related problem of upward simultaneous embedding without mapping, proving that deciding whether two directed graphs admit an upward simultaneous embedding without mapping is .-hard.作者: outrage 時(shí)間: 2025-3-30 21:03
https://doi.org/10.1057/9781137444325raph. We also characterize the class of biconnected outerplanar graphs that always have a . with any other outerplanar graph. In both cases, we provide efficient algorithms to compute a .. Finally, we provide a linear-time decision algorithm for deciding whether a pair of biconnected outerplanar graphs has a ..作者: 凝乳 時(shí)間: 2025-3-31 00:54
https://doi.org/10.1057/9781137265067per bound on the number of maximal bicliques [Combinatorica, 2000] and show that the maximum number of maximal bicliques in a graph on . vertices is exactly 3. (up to a polynomial factor). The main results of this paper are .(1.3642.) time algorithms to compute the number of maximal independent sets and maximal bicliques in a graph.作者: CLAIM 時(shí)間: 2025-3-31 07:00 作者: Evocative 時(shí)間: 2025-3-31 11:24
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspectiveand algorithms have been proposed in the literature to study routing oscillations. The goal of this paper is to provide a survey of state of the art contributions in this field with an emphasis on the algorithmic aspects.作者: artifice 時(shí)間: 2025-3-31 13:48
Algorithmic Meta Theoremstimisation problems on classes of graphs with excluded minors can be approximated in polynomial time to any given approximation ratio [3]..In my talk, I gave an overview of algorithmic meta theorems and the main techniques used in their proofs. Reference [4] is a comprehensive survey of the material.作者: 離開(kāi) 時(shí)間: 2025-3-31 19:30
The Valve Location Problem in Simple Network Topologies (i) for series-parallel graphs and hence for graphs of treewidth two; (ii) if all edge weights equal one. If the network is a simple path, a cycle, or a tree, the problem can be solved in polynomial time. We also give a pseudo-polynomial time algorithm and a fully polynomial approximation scheme for networks of bounded treewidth.作者: grenade 時(shí)間: 2025-3-31 22:22 作者: 放逐 時(shí)間: 2025-4-1 03:20 作者: gene-therapy 時(shí)間: 2025-4-1 08:28
