書(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 21:41
https://doi.org/10.1007/978-1-4899-2218-22 and proving the intractability of the problem for any fixed . >2. While for general topologies the problem was known to be NP-hard . not constant, the complexity for fixed values of . was still an open question.作者: Cubicle 時(shí)間: 2025-3-22 01:26 作者: Amplify 時(shí)間: 2025-3-22 08:31 作者: Antarctic 時(shí)間: 2025-3-22 10:58
Divide-and-Color,randomization gives deterministic algorithms for these problems with running times . .(2.) and . .(2.), respectively..All these results significantly improve over the currently known best bounds. In particular, our generic algorithms beat specialized ones that have been designed to find . triangles or paths of length two.作者: DEAWL 時(shí)間: 2025-3-22 14:43
Approximating the Traffic Grooming Problem in Tree and Star Networks,2 and proving the intractability of the problem for any fixed . >2. While for general topologies the problem was known to be NP-hard . not constant, the complexity for fixed values of . was still an open question.作者: DEAWL 時(shí)間: 2025-3-22 19:56 作者: 熒光 時(shí)間: 2025-3-23 00:04
Generation of Graphs with Bounded Branchwidth,cliques exists for any value of ., except for .=8,.=2. We characterize subgraph-minimal .-branches for all values of .. Our investigation leads to a generation algorithm, that adds one or two new maximal cliques in each step, producing exactly the .-branches.作者: 犬儒主義者 時(shí)間: 2025-3-23 02:21 作者: Infraction 時(shí)間: 2025-3-23 07:43 作者: 撕裂皮肉 時(shí)間: 2025-3-23 10:21 作者: Ancillary 時(shí)間: 2025-3-23 15:41 作者: Fracture 時(shí)間: 2025-3-23 20:12
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs,t in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating set of a graph on . vertices in time .(1.3575.). Furthermore, we show that Ω(1.3247.) is a lower bound on the worst-case running time of this algorithm.作者: 臭名昭著 時(shí)間: 2025-3-23 23:07
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time,parability graph using .(.) integers so that, given two vertices, it can be determined in .(1) time whether they are adjacent, no matter how dense the graph is. We give a linear-time algorithm for finding the four linear orders, improving on their bound of .(. .).作者: 誘導(dǎo) 時(shí)間: 2025-3-24 05:53
https://doi.org/10.1007/978-1-4615-1203-5t in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating set of a graph on . vertices in time .(1.3575.). Furthermore, we show that Ω(1.3247.) is a lower bound on the worst-case running time of this algorithm.作者: 老人病學(xué) 時(shí)間: 2025-3-24 08:06 作者: aquatic 時(shí)間: 2025-3-24 11:23 作者: Callus 時(shí)間: 2025-3-24 18:08
Generalised Dualities and Finite Maximal Antichains,existence of homomorphism. We show that these antichains correspond exactly to the generalised dualities. This solves a problem posed in [1]. Finally, we show that it is NP-hard to decide whether a finite set of digraphs forms a maximal antichain.作者: 粘連 時(shí)間: 2025-3-24 20:38 作者: Torrid 時(shí)間: 2025-3-25 03:05
Generalised Dualities and Finite Maximal Antichains,termined by a finite number of forbidden subgraphs. We prove that these situations, called ., are characterised by the non-existence of a homomorphism to?. from a finite set of forests..Furthermore, we characterise all finite maximal antichains in the partial order of directed graphs ordered by the 作者: 慢跑鞋 時(shí)間: 2025-3-25 04:02
Divide-and-Color,t randomly colors all edges or nodes of a graph black and white, and then solves the problem recursively on the two induced parts..We demonstrate this technique by giving new randomized algorithms for the solution of two important problems. These yield runtime bounds of . .(4.) for finding a simple 作者: hangdog 時(shí)間: 2025-3-25 09:33
Listing Chordal Graphs and Interval Graphs,h (in K.) of ., and to find every interval subgraph of . in K.. The algorithms are based on the reverse search method. A graph is chordal if and only if it has no induced chordless cycle of length more than three. A graph is an interval graph if and only if it has an interval representation. To the 作者: artless 時(shí)間: 2025-3-25 12:10
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs,dent set, i.e. no vertices in . are pairwise adjacent, then . is said to be an independent dominating set. Finding a minimum independent dominating set in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating set of a graph on . vertices in time .(1.3575.). F作者: Glower 時(shí)間: 2025-3-25 17:54
Improved Edge-Coloring with Three Colors,he previous, .(2.) algorithm of Beigel and Eppstein [1]. We extend a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the “measure and conquer” technique.作者: 傷心 時(shí)間: 2025-3-25 22:52
,Vertex Coloring of Comparability+,e and –,e Graphs,ges from a graph in .. In this paper, we consider vertex coloring of comparability+.e and comparability–.e graphs. We show that for comparability+.e graphs, vertex coloring is solved in polynomial time for .=1 and NP-complete for . ≥2. We also show that vertex coloring of comparability–1e graphs is 作者: entitle 時(shí)間: 2025-3-26 03:00 作者: Debility 時(shí)間: 2025-3-26 06:53 作者: progestin 時(shí)間: 2025-3-26 11:42
Approximating the Traffic Grooming Problem in Tree and Star Networks,r of used ADMs. We first present efficient approximation algorithms with approximation factor of 2 ln (. . .) + .(ln (. . .)) for any fixed node degree bound . and grooming factor ., and 2ln .+ .( ln .) in unbounded degree directed trees, respectively. In the attempt of extending our results to gene作者: 期滿 時(shí)間: 2025-3-26 15:27
Bounded Arboricity to Determine the Local Structure of Sparse Graphs,bility vectors to detect the communities, see Latapy and Pons [2005]. In this paper we focus on the first part of such an approach . the computation of the probability vectors for the random walks, and propose a more efficient algorithm for computing these vectors in time complexity that is linear i作者: Recess 時(shí)間: 2025-3-26 20:14
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time,al comparability graphs are comparability graphs of posets of dimension four. Among other uses, this gives an implicit representation of a chordal comparability graph using .(.) integers so that, given two vertices, it can be determined in .(1) time whether they are adjacent, no matter how dense the作者: 有發(fā)明天才 時(shí)間: 2025-3-26 23:58
Partitioned Probe Comparability Graphs,obes such that . can be embedded into a graph of . by adding edges between certain nonprobes. If the partition of the vertices is a part of the input we call . a partitioned probe graph of .. In this paper we show that there exists a polynomial-time algorithm for the recognition of partitioned probe作者: 控訴 時(shí)間: 2025-3-27 02:12 作者: 不來(lái) 時(shí)間: 2025-3-27 07:34
Generation of Graphs with Bounded Branchwidth,subgraphs of .-trees. n this paper, we investigate the family of edge-maximal graphs of branchwidth ., that we call .-branches. The .-branches are, just as the .-trees, a subclass of the chordal graphs where all minimal separators have size .. However, a striking difference arises when considering s作者: evasive 時(shí)間: 2025-3-27 11:34 作者: 影響 時(shí)間: 2025-3-27 17:07
https://doi.org/10.1007/978-94-017-2308-4termined by a finite number of forbidden subgraphs. We prove that these situations, called ., are characterised by the non-existence of a homomorphism to?. from a finite set of forests..Furthermore, we characterise all finite maximal antichains in the partial order of directed graphs ordered by the 作者: Spangle 時(shí)間: 2025-3-27 20:29
https://doi.org/10.1007/978-3-642-59086-3t randomly colors all edges or nodes of a graph black and white, and then solves the problem recursively on the two induced parts..We demonstrate this technique by giving new randomized algorithms for the solution of two important problems. These yield runtime bounds of . .(4.) for finding a simple 作者: 外露 時(shí)間: 2025-3-28 01:51 作者: Delirium 時(shí)間: 2025-3-28 04:50
https://doi.org/10.1007/978-1-4615-1203-5dent set, i.e. no vertices in . are pairwise adjacent, then . is said to be an independent dominating set. Finding a minimum independent dominating set in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating set of a graph on . vertices in time .(1.3575.). F作者: heterogeneous 時(shí)間: 2025-3-28 09:54
Molecular Biology in Crop Protectionhe previous, .(2.) algorithm of Beigel and Eppstein [1]. We extend a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the “measure and conquer” technique.作者: 壁畫(huà) 時(shí)間: 2025-3-28 11:20 作者: Figate 時(shí)間: 2025-3-28 17:28 作者: 褪色 時(shí)間: 2025-3-28 21:01
Hector R. Wong,Thomas P. Shanley them if either their intervals intersect or they belong to the same row. We show that recognition of the class of strip graphs is .-complete even if all intervals are of length 2. Strip graphs are important to the study of job selection, where we need an equivalence relation to connect multiple int作者: 小溪 時(shí)間: 2025-3-29 00:56
https://doi.org/10.1007/978-1-4899-2218-2r of used ADMs. We first present efficient approximation algorithms with approximation factor of 2 ln (. . .) + .(ln (. . .)) for any fixed node degree bound . and grooming factor ., and 2ln .+ .( ln .) in unbounded degree directed trees, respectively. In the attempt of extending our results to gene作者: 修改 時(shí)間: 2025-3-29 04:46
https://doi.org/10.1007/978-1-4757-2778-4bility vectors to detect the communities, see Latapy and Pons [2005]. In this paper we focus on the first part of such an approach . the computation of the probability vectors for the random walks, and propose a more efficient algorithm for computing these vectors in time complexity that is linear i作者: WATER 時(shí)間: 2025-3-29 08:37
Michel Chrétien,Kenneth W. McKernsal comparability graphs are comparability graphs of posets of dimension four. Among other uses, this gives an implicit representation of a chordal comparability graph using .(.) integers so that, given two vertices, it can be determined in .(1) time whether they are adjacent, no matter how dense the作者: 辯論 時(shí)間: 2025-3-29 12:52
Molecular Biology of Chromosome Functionobes such that . can be embedded into a graph of . by adding edges between certain nonprobes. If the partition of the vertices is a part of the input we call . a partitioned probe graph of .. In this paper we show that there exists a polynomial-time algorithm for the recognition of partitioned probe作者: –LOUS 時(shí)間: 2025-3-29 17:41
https://doi.org/10.1007/978-1-4612-0241-7polynomial and the two-variable interlace polynomial of a graph . of clique-width at most . with . vertices can be computed in time .(. .), where .(.) ≤3 for the inerlace polynomial, .(.) ≤2.+1 for the matching polynomial and .(.) ≤3 .2. for the chromatic polynomial.作者: 讓你明白 時(shí)間: 2025-3-29 22:26
Molecular Biology of Drug Addictionsubgraphs of .-trees. n this paper, we investigate the family of edge-maximal graphs of branchwidth ., that we call .-branches. The .-branches are, just as the .-trees, a subclass of the chordal graphs where all minimal separators have size .. However, a striking difference arises when considering s作者: Felicitous 時(shí)間: 2025-3-30 03:32
https://doi.org/10.1007/978-1-4020-8243-6mially solvable, contrasting its APX-hardness for the case of unlimited availability of items. However, if the underlying graph is a grid, and edge multiplicities are one, we show that it is even NP-complete to approximate the maximum profit to within a factor . ..作者: peritonitis 時(shí)間: 2025-3-30 04:13 作者: 監(jiān)禁 時(shí)間: 2025-3-30 11:44
How to Sell a Graph: Guidelines for Graph Retailers,mially solvable, contrasting its APX-hardness for the case of unlimited availability of items. However, if the underlying graph is a grid, and edge multiplicities are one, we show that it is even NP-complete to approximate the maximum profit to within a factor . ..作者: 消耗 時(shí)間: 2025-3-30 15:59 作者: Cryptic 時(shí)間: 2025-3-30 20:08 作者: 熱心 時(shí)間: 2025-3-30 23:49
https://doi.org/10.1007/978-4-431-68467-1We present a fixed-parameter algorithm which computes for a set . of . points in the plane in . time a minimum weight triangulation. The parameter . is the number of points in . that lie in the interior of the convex hull of . and ..作者: 商品 時(shí)間: 2025-3-31 04:34
https://doi.org/10.1007/978-1-4020-8245-0In this paper, we study a new problem of finding a convex drawing of graphs with a . boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an ., can be obtained in linear time.作者: 喊叫 時(shí)間: 2025-3-31 08:28 作者: 泰然自若 時(shí)間: 2025-3-31 12:58 作者: cajole 時(shí)間: 2025-3-31 14:32
Convex Drawings of Graphs with Non-convex Boundary,In this paper, we study a new problem of finding a convex drawing of graphs with a . boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an ., can be obtained in linear time.作者: Offensive 時(shí)間: 2025-3-31 18:44
Graph-Theoretic Concepts in Computer Science978-3-540-48382-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: anarchist 時(shí)間: 2025-4-1 00:30 作者: 記憶法 時(shí)間: 2025-4-1 02:38
Molecular Biology in Crop Protectionhe previous, .(2.) algorithm of Beigel and Eppstein [1]. We extend a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the “measure and conquer” technique.作者: 注射器 時(shí)間: 2025-4-1 06:36
https://doi.org/10.1007/978-1-4020-8247-4ges from a graph in .. In this paper, we consider vertex coloring of comparability+.e and comparability–.e graphs. We show that for comparability+.e graphs, vertex coloring is solved in polynomial time for .=1 and NP-complete for . ≥2. We also show that vertex coloring of comparability–1e graphs is solved in polynomial time.
