書目名稱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é)科排名
作者: plasma 時(shí)間: 2025-3-21 21:08 作者: lanugo 時(shí)間: 2025-3-22 03:26 作者: patriarch 時(shí)間: 2025-3-22 06:26 作者: choroid 時(shí)間: 2025-3-22 12:15
https://doi.org/10.1007/978-3-663-04349-2lass of cocomparability graphs. Our result resolves the open question for the complexity of the problem on such graphs, and since cocomparability graphs form a superclass of both interval and permutation graphs, extends the polynomial solution of the longest path problem on interval graphs[18] and p作者: disrupt 時(shí)間: 2025-3-22 16:29 作者: disrupt 時(shí)間: 2025-3-22 18:13 作者: 辭職 時(shí)間: 2025-3-22 22:46
Algorithmic Graph Minors and Bidimensionalityything closed under deletion and contraction). In recent years, this theory has been extended and generalized to apply to many algorithmic problems. Bidimensionality theory is one approach to algorithmic graph minor theory. This theory provides general tools for designing fast (constructive, often s作者: Clumsy 時(shí)間: 2025-3-23 02:45 作者: 懸掛 時(shí)間: 2025-3-23 08:26 作者: 縮影 時(shí)間: 2025-3-23 12:47
The Longest Path Problem is Polynomial on Cocomparability Graphscomplete on general graphs and, in fact, on every class of graphs that the Hamiltonian path problem is NP-complete. Polynomial solutions for the longest path problem have recently been proposed for weighted trees, ptolemaic graphs, bipartite permutation graphs, interval graphs, and some small classe作者: 情感 時(shí)間: 2025-3-23 17:54 作者: EWER 時(shí)間: 2025-3-23 18:33
On Stable Matchings and Flowsthat there always exists a stable flow and generalize the lattice structure of stable marriages to stable flows. Our main tool is a straightforward reduction of the stable flow problem to stable allocations.作者: Abominate 時(shí)間: 2025-3-24 00:04 作者: Retrieval 時(shí)間: 2025-3-24 03:18 作者: Nutrient 時(shí)間: 2025-3-24 10:31
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matchingit has capacity to dominate. Cygan et al. showed in 2009 that this problem can be solved in . or in ..(1.89.) time using maximum matching algorithm. An alternative way to solve this problem is to use dynamic programming over subsets. By exploiting structural properties of instances that can not be s作者: 種植,培養(yǎng) 時(shí)間: 2025-3-24 14:13 作者: Hearten 時(shí)間: 2025-3-24 17:38 作者: Flinch 時(shí)間: 2025-3-24 22:52 作者: entitle 時(shí)間: 2025-3-25 02:17
Graphs that Admit Right Angle Crossing Drawingsh with . vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most 6.5. and 74.2., respectively. This is a strengthening of a recent result of Didimo ..作者: colloquial 時(shí)間: 2025-3-25 06:00 作者: 闡明 時(shí)間: 2025-3-25 10:36 作者: 石墨 時(shí)間: 2025-3-25 14:06
Generalized Graph Clustering: Recognizing (,,,)-Cluster Graphsion of cliques, i.e, clusters. As pointed out in a number of recent papers, the cluster editing model is too rigid to capture common features of real data sets. Several generalizations have thereby been proposed. In this paper, we introduce (.,.)-cluster graphs, where each cluster misses at most . e作者: boisterous 時(shí)間: 2025-3-25 17:03
Colouring Vertices of Triangle-Free Graphsh . which is not a forest. We study the computational complexity of the problem in (.., .)-free graphs with . being a forest. From known results it follows that for any forest . on 5 vertices the . problem is polynomial-time solvable in the class of (.., .)-free graphs. In the present paper, we show作者: 現(xiàn)實(shí) 時(shí)間: 2025-3-25 21:26
A Quartic Kernel for Pathwidth-One Vertex Deletionost . vertices in . whose deletion results in a graph of pathwidth at most one is NP-Complete. We initiate the study of the parameterized complexity of this problem, parameterized by .. We show that the problem has a quartic vertex-kernel: We show that, given an input instance (.?=?(.,.),.);|.|?=?.,作者: 暗語 時(shí)間: 2025-3-26 00:36 作者: 處理 時(shí)間: 2025-3-26 05:02
https://doi.org/10.1007/978-3-662-25310-6ything closed under deletion and contraction). In recent years, this theory has been extended and generalized to apply to many algorithmic problems. Bidimensionality theory is one approach to algorithmic graph minor theory. This theory provides general tools for designing fast (constructive, often s作者: consolidate 時(shí)間: 2025-3-26 12:27 作者: Colonnade 時(shí)間: 2025-3-26 13:00 作者: 中止 時(shí)間: 2025-3-26 19:00
https://doi.org/10.1007/978-3-663-04349-2complete on general graphs and, in fact, on every class of graphs that the Hamiltonian path problem is NP-complete. Polynomial solutions for the longest path problem have recently been proposed for weighted trees, ptolemaic graphs, bipartite permutation graphs, interval graphs, and some small classe作者: Nibble 時(shí)間: 2025-3-26 22:17
https://doi.org/10.1007/978-94-009-8198-0 is fixed and small. For edge 3-colorings the following is achieved: there is a branching algorithm to enumerate all edge 3-colorings of a connected cubic graph in time ..(2.). This implies that the maximum number of edge 3-colorings in an .-vertex connected cubic graph is ..(2.). Finally, the maxim作者: 欺騙手段 時(shí)間: 2025-3-27 04:40
https://doi.org/10.1007/978-3-658-17475-0that there always exists a stable flow and generalize the lattice structure of stable marriages to stable flows. Our main tool is a straightforward reduction of the stable flow problem to stable allocations.作者: 桶去微染 時(shí)間: 2025-3-27 05:49 作者: 解開 時(shí)間: 2025-3-27 10:40 作者: HAIL 時(shí)間: 2025-3-27 15:55 作者: 宮殿般 時(shí)間: 2025-3-27 19:55 作者: 確定 時(shí)間: 2025-3-28 00:57 作者: ellagic-acid 時(shí)間: 2025-3-28 02:49 作者: galley 時(shí)間: 2025-3-28 09:30 作者: 花費(fèi) 時(shí)間: 2025-3-28 14:18 作者: 偽造者 時(shí)間: 2025-3-28 17:12
https://doi.org/10.1007/978-3-658-09565-9a decomposition of . of boolean-width ., we give algorithms solving a large class of vertex subset and vertex partitioning problems in time .. We relate the boolean-width of a graph to its branch-width and to the boolean-width of its incidence graph. For this we use a constructive proof method that 作者: 棲息地 時(shí)間: 2025-3-28 21:06
https://doi.org/10.1007/978-3-031-33013-1ion of cliques, i.e, clusters. As pointed out in a number of recent papers, the cluster editing model is too rigid to capture common features of real data sets. Several generalizations have thereby been proposed. In this paper, we introduce (.,.)-cluster graphs, where each cluster misses at most . e作者: Exposure 時(shí)間: 2025-3-29 01:35
https://doi.org/10.1007/978-1-349-19404-9h . which is not a forest. We study the computational complexity of the problem in (.., .)-free graphs with . being a forest. From known results it follows that for any forest . on 5 vertices the . problem is polynomial-time solvable in the class of (.., .)-free graphs. In the present paper, we show作者: antidote 時(shí)間: 2025-3-29 03:57 作者: LUDE 時(shí)間: 2025-3-29 08:46
https://doi.org/10.1007/978-3-030-05695-7s, we prove dichotomy theorems. For the minor order, we show how to solve .?in polynomial time for the class obtained by forbidding a graph with crossing number at most one (this generalizes a known result for ..-minor-free graphs) and identify an open problem which is the missing case for a dichotomy theorem.作者: Negotiate 時(shí)間: 2025-3-29 14:37 作者: POLYP 時(shí)間: 2025-3-29 17:22 作者: Medicare 時(shí)間: 2025-3-29 20:26 作者: 為現(xiàn)場 時(shí)間: 2025-3-30 03:01
,?and Containment Relations in Graphss, we prove dichotomy theorems. For the minor order, we show how to solve .?in polynomial time for the class obtained by forbidding a graph with crossing number at most one (this generalizes a known result for ..-minor-free graphs) and identify an open problem which is the missing case for a dichotomy theorem.作者: Efflorescent 時(shí)間: 2025-3-30 07:46
On Stable Matchings and Flowsthat there always exists a stable flow and generalize the lattice structure of stable marriages to stable flows. Our main tool is a straightforward reduction of the stable flow problem to stable allocations.作者: Irrigate 時(shí)間: 2025-3-30 08:19
Milling a Graph with Turn Costs: A Parameterized Complexity Perspectiveits vertices with a minimum number of ., as specified in the graph model by a 0/1 turncost function .. at each vertex . giving, for each ordered pair of edges (.,.) incident at ., the . at . of a walk that enters the vertex on edge . and departs on edge .. We describe an initial study of the parameterized complexity of the problem.作者: oxidize 時(shí)間: 2025-3-30 15:20 作者: lipoatrophy 時(shí)間: 2025-3-30 19:45 作者: 樣式 時(shí)間: 2025-3-30 21:56
https://doi.org/10.1007/978-94-009-8198-0ected cubic graphs. We also present dynamic programming algorithms to count the number of edge .-colorings and total .-colorings for graphs of bounded pathwidth. These algorithms can be used to obtain fast exact exponential time algorithms for counting edge .-colorings and total .-colorings on graphs, if . is small.作者: enterprise 時(shí)間: 2025-3-31 03:11
https://doi.org/10.1007/978-3-662-68035-3mutation graphs. Our algorithm runs in linear time. We stress that the cutwidth problem is NP-complete on bipartite graphs and its computational complexity is open even on small subclasses of permutation graphs, such as trivially perfect graphs.作者: GEON 時(shí)間: 2025-3-31 07:29 作者: patriot 時(shí)間: 2025-3-31 12:50 作者: GROVE 時(shí)間: 2025-3-31 14:02
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Timemutation graphs. Our algorithm runs in linear time. We stress that the cutwidth problem is NP-complete on bipartite graphs and its computational complexity is open even on small subclasses of permutation graphs, such as trivially perfect graphs.作者: 平靜生活 時(shí)間: 2025-3-31 17:36
Generalized Graph Clustering: Recognizing (,,,)-Cluster Graphsr of false positives and negatives in total, while bounding the number of these locally for each cluster by . and .. We show that recognizing (.,.)-cluster graphs is NP-complete when . and . are input. On the positive side, we show that (0,.)-cluster, (.,1)-cluster, (.,2)-cluster, and (1,3)-cluster graphs can be recognized in polynomial time.作者: 桶去微染 時(shí)間: 2025-3-31 23:30 作者: neologism 時(shí)間: 2025-4-1 05:37
