書目名稱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é)科排名
作者: 項(xiàng)目 時(shí)間: 2025-3-21 21:59 作者: Amenable 時(shí)間: 2025-3-22 03:48
https://doi.org/10.1007/978-94-010-3177-6thm for graphs with maximum degree 3. In this paper it is shown that the problem is .-complete when restricted to planar graphs with girth 5 and planar graphs with maximum degree 4. In addition, for claw-free graphs and planar graphs with girth at least 7 polynomial algorithms to find matching-cuts are described.作者: aerial 時(shí)間: 2025-3-22 06:53
https://doi.org/10.1057/9780230623347 that a completely connected clustered graph is c-planar if and only if the underlying graph is planar. Further, we investigate the influence of the root of the inclusion tree to the choice of the outer face of the underlying graph and vice versa.作者: 獎(jiǎng)牌 時(shí)間: 2025-3-22 12:40
https://doi.org/10.5822/978-1-61091-609-7ces are constrained to be on any given curve of . and the edges are drawn as polylines with at most one bend. We prove that every planar graph has a curve embedding which can be computed in linear time. Further we present applications of the concept of curve embedding to upward drawings and point-set constrained drawings.作者: disciplined 時(shí)間: 2025-3-22 15:10 作者: disciplined 時(shí)間: 2025-3-22 19:40
Minimum Flow Time Graph Orderingthe jobs. We prove that the problem is NP-hard in general and is polynomial on trees. We then provide a 2-approximate algorithm and investigate necessary conditions for optimality. On this basis, we devised a combinatorial branch-and-bound algorithm and tested it on random graphs with up to 100 nodes.作者: peritonitis 時(shí)間: 2025-3-22 22:00
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grcal engineering. Here, different design representations of a chemical plant have to be kept consistent with each other. Incremental integration tools assist in propagating changes and performing consistency analysis. The integration tools are driven by triple rules which define relationships between design documents.作者: Synovial-Fluid 時(shí)間: 2025-3-23 01:38 作者: 逃避責(zé)任 時(shí)間: 2025-3-23 09:28
Completely Connected Clustered Graphs that a completely connected clustered graph is c-planar if and only if the underlying graph is planar. Further, we investigate the influence of the root of the inclusion tree to the choice of the outer face of the underlying graph and vice versa.作者: mydriatic 時(shí)間: 2025-3-23 11:49
Drawing Planar Graphs on a Curveces are constrained to be on any given curve of . and the edges are drawn as polylines with at most one bend. We prove that every planar graph has a curve embedding which can be computed in linear time. Further we present applications of the concept of curve embedding to upward drawings and point-set constrained drawings.作者: Entrancing 時(shí)間: 2025-3-23 17:38
Resource Allocation Problems in Multifiber WDM Tree Networks of accepted requests for given fibers and bounded number . of wavelengths. We study both problems in undirected tree networks .=(.,.) and present approximation algorithms with ratio 1 + 4|E|log|V|/. and 4 for the former and ratio 2.542 for the latter. Our results can be adapted to directed trees as well.作者: IDEAS 時(shí)間: 2025-3-23 21:00 作者: 協(xié)奏曲 時(shí)間: 2025-3-23 22:12 作者: TRUST 時(shí)間: 2025-3-24 05:39 作者: 縱火 時(shí)間: 2025-3-24 08:30 作者: Itinerant 時(shí)間: 2025-3-24 13:39 作者: 剛毅 時(shí)間: 2025-3-24 15:17 作者: 整潔 時(shí)間: 2025-3-24 20:49
https://doi.org/10.1007/978-1-4612-3544-6fecting the correctness or performance of the program. Finally, we present several classes of graphs that can be used for watermarking and fingerprinting and analyze their properties (resiliency, data rate, performance, and stealthiness).作者: 主動(dòng) 時(shí)間: 2025-3-25 00:30
https://doi.org/10.1007/978-3-030-63930-3eath [2001] and disproving a conjecture of Pemmaraju [1992]. This result provides renewed hope for the positive resolution of a number of open problems regarding queue layouts. In a related result, it is proved that graphs of bounded tree-width have . with linear volume, which represents the largest known class of graphs with such drawings.作者: Foolproof 時(shí)間: 2025-3-25 03:19 作者: Acupressure 時(shí)間: 2025-3-25 08:45
Greedy Edge-Disjoint Paths in Complete GraphsMEDP in undirected graphs with flow number . and, therefore, has approximation ratio at most 9 in complete graphs. Furthermore, we construct a family of instances that shows that SGA cannot be better than a 3-approximation algorithm. Our upper and lower bounds hold also for the bounded-length greedy algorithm, a simple on-line algorithm for MEDP.作者: 一起平行 時(shí)間: 2025-3-25 13:26 作者: 運(yùn)動(dòng)性 時(shí)間: 2025-3-25 19:46 作者: arboretum 時(shí)間: 2025-3-26 00:03
https://doi.org/10.1007/978-3-031-17222-9 the dimer constant. Main results are improved complexity bounds for finding a perfect matching in a regular bipartite graph and for edge-colouring bipartite graphs, the solution of a problem of Erd?s and Rényi concerning lower bounds for the number of perfect matchings, and an improved lower bound 作者: Ataxia 時(shí)間: 2025-3-26 00:42 作者: 必死 時(shí)間: 2025-3-26 08:04 作者: 農(nóng)學(xué) 時(shí)間: 2025-3-26 08:29 作者: constitute 時(shí)間: 2025-3-26 14:31
https://doi.org/10.1007/978-3-031-28624-7 graph. It is widely used as a component in every sparse matrix package, and it is known to produce triangulations with few fill edges in practice, although no theoretical bound or guarantee has been shown on its quality. Another interesting behavior of Minimum Degree observed in practice is that it作者: Hippocampus 時(shí)間: 2025-3-26 18:34
https://doi.org/10.1007/978-1-4842-7918-2he multi-terminal network flows. The procedure he proposed requires the computation of as many Gomory-Hu cut trees as the number of critical capacities of the edge, leading to a pseudo-polynomial algorithm..In this paper, we propose a fully polynomial algorithm using only two Gomory-Hu cut trees to 作者: excrete 時(shí)間: 2025-3-27 00:04 作者: 多嘴多舌 時(shí)間: 2025-3-27 04:08
https://doi.org/10.1007/978-94-010-3177-6 of the Decomposable Graph Recognition problem, and proved the problem to be .-complete for graphs with maximum degree 4, and gave a polynomial algorithm for graphs with maximum degree 3. In this paper it is shown that the problem is .-complete when restricted to planar graphs with girth 5 and plana作者: Mirage 時(shí)間: 2025-3-27 07:00
https://doi.org/10.1007/978-3-662-43550-2n .. The tree .-spanner problem asks whether a graph admits a tree .-spanner, given .. We first substantially strengthen the known results for bipartite graphs. We prove that the tree .-spanner problem is .-complete even for chordal bipartite graphs for .?≥?5, and every bipartite ATE–free graph has 作者: AGONY 時(shí)間: 2025-3-27 10:49
https://doi.org/10.1007/978-1-4615-4297-1thms, the new algorithm uses a multisweep Lexicographic Breadth First Search (LexBFS) approach, and introduces a new variant of LexBFS, called LexBFS., operating on the complement of the given graph . and breaking ties with respect to an initial LexBFS. The algorithm either produces the cotree of . 作者: PTCA635 時(shí)間: 2025-3-27 16:39 作者: 通情達(dá)理 時(shí)間: 2025-3-27 21:34
Majid Sarrafzadeh,Maogang Wang,Xiaojian Yangal approximation algorithm, the shortest-path-first greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio is at most 54. Adapting results by Kolman and Scheideler [Proceedings of SODA, 2002, pp. 184–193], we show that SGA achieves approximation ratio 8.+1 for 作者: Derogate 時(shí)間: 2025-3-27 23:45 作者: 認(rèn)識(shí) 時(shí)間: 2025-3-28 05:04 作者: 休息 時(shí)間: 2025-3-28 08:13 作者: 游行 時(shí)間: 2025-3-28 14:02
https://doi.org/10.1007/978-3-030-63930-3.-tree has a tree-partition such that each bag induces a (.-1)-tree, amongst other properties. Applications of this result to two well-studied models of graph layout are presented. First it is proved that graphs of bounded tree-width have bounded ., thus resolving an open problem due to Ganley and H作者: 聯(lián)合 時(shí)間: 2025-3-28 16:24
https://doi.org/10.1007/978-1-349-86076-0total number of fibers necessary to establish a given set of requests with a bounded number . of wavelengths, and the problem of maximizing the number of accepted requests for given fibers and bounded number . of wavelengths. We study both problems in undirected tree networks .=(.,.) and present app作者: 厭煩 時(shí)間: 2025-3-28 21:03
Matching, Edge-Colouring, and Dimers the dimer constant. Main results are improved complexity bounds for finding a perfect matching in a regular bipartite graph and for edge-colouring bipartite graphs, the solution of a problem of Erd?s and Rényi concerning lower bounds for the number of perfect matchings, and an improved lower bound 作者: 預(yù)兆好 時(shí)間: 2025-3-28 23:30
Minimum Flow Time Graph Ordering. A linear layout of the vertices corresponds then to a production schedule, and one wants to find a layout minimizing the average completion time of the jobs. We prove that the problem is NP-hard in general and is polynomial on trees. We then provide a 2-approximate algorithm and investigate necess作者: 摘要記錄 時(shí)間: 2025-3-29 03:28
Searching Is Not Jumpingaph, using searchers; an edge is clear if it cannot contain the searched entity, contaminated otherwise. The . of a graph . is the smallest number of searchers required to “clear” .. A search strategy is . (.) if no recontamination ever occurs. It is . (.) if the set of clear edges always forms a co作者: PON 時(shí)間: 2025-3-29 09:12 作者: Foreknowledge 時(shí)間: 2025-3-29 12:49 作者: vasospasm 時(shí)間: 2025-3-29 19:06 作者: Compass 時(shí)間: 2025-3-29 22:45
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generationible in linear time, implies the existence of bijection between rooted outerplanar maps with . nodes and bicolored rooted ordered trees with . nodes where all the nodes of the last branch are colored white. As a consequence, for rooted outerplanar maps of . nodes, we derive:作者: 下邊深陷 時(shí)間: 2025-3-30 01:56 作者: 高度 時(shí)間: 2025-3-30 05:32
Tree Spanners for Bipartite Graphs and Probe Interval Graphsn .. The tree .-spanner problem asks whether a graph admits a tree .-spanner, given .. We first substantially strengthen the known results for bipartite graphs. We prove that the tree .-spanner problem is .-complete even for chordal bipartite graphs for .?≥?5, and every bipartite ATE–free graph has 作者: 華而不實(shí) 時(shí)間: 2025-3-30 10:12
A Simple Linear Time LexBFS Cograph Recognition Algorithmthms, the new algorithm uses a multisweep Lexicographic Breadth First Search (LexBFS) approach, and introduces a new variant of LexBFS, called LexBFS., operating on the complement of the given graph . and breaking ties with respect to an initial LexBFS. The algorithm either produces the cotree of . 作者: STRIA 時(shí)間: 2025-3-30 15:42 作者: Bureaucracy 時(shí)間: 2025-3-30 18:29
Greedy Edge-Disjoint Paths in Complete Graphsal approximation algorithm, the shortest-path-first greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio is at most 54. Adapting results by Kolman and Scheideler [Proceedings of SODA, 2002, pp. 184–193], we show that SGA achieves approximation ratio 8.+1 for 作者: 領(lǐng)巾 時(shí)間: 2025-3-30 23:47 作者: 比目魚 時(shí)間: 2025-3-31 01:50
Completely Connected Clustered Graphsaphs that have the property that not only every cluster but also each complement of a cluster induces a connected subgraph. As a main result, we prove that a completely connected clustered graph is c-planar if and only if the underlying graph is planar. Further, we investigate the influence of the r作者: Formidable 時(shí)間: 2025-3-31 08:47
Drawing Planar Graphs on a Curve planar graph. A curve embedding of . is a linear ordering of the vertices of . such that there exists a crossing-free 2D drawing of . where the vertices are constrained to be on any given curve of . and the edges are drawn as polylines with at most one bend. We prove that every planar graph has a c作者: 人類 時(shí)間: 2025-3-31 11:34
Tree-Partitions of ,-Trees with Applications in Graph Layout.-tree has a tree-partition such that each bag induces a (.-1)-tree, amongst other properties. Applications of this result to two well-studied models of graph layout are presented. First it is proved that graphs of bounded tree-width have bounded ., thus resolving an open problem due to Ganley and H作者: ANTE 時(shí)間: 2025-3-31 16:41 作者: Angiogenesis 時(shí)間: 2025-3-31 18:29
https://doi.org/10.1007/978-3-031-17222-9 the dimer constant. Main results are improved complexity bounds for finding a perfect matching in a regular bipartite graph and for edge-colouring bipartite graphs, the solution of a problem of Erd?s and Rényi concerning lower bounds for the number of perfect matchings, and an improved lower bound for s dimer constant.作者: Thymus 時(shí)間: 2025-3-31 23:34
https://doi.org/10.1007/978-981-15-9313-0ible in linear time, implies the existence of bijection between rooted outerplanar maps with . nodes and bicolored rooted ordered trees with . nodes where all the nodes of the last branch are colored white. As a consequence, for rooted outerplanar maps of . nodes, we derive:作者: ATRIA 時(shí)間: 2025-4-1 03:20
https://doi.org/10.1007/978-1-4615-4297-1thms, the new algorithm uses a multisweep Lexicographic Breadth First Search (LexBFS) approach, and introduces a new variant of LexBFS, called LexBFS., operating on the complement of the given graph . and breaking ties with respect to an initial LexBFS. The algorithm either produces the cotree of . or identifies an induced ...作者: Deadpan 時(shí)間: 2025-4-1 09:18
Matching, Edge-Colouring, and Dimers the dimer constant. Main results are improved complexity bounds for finding a perfect matching in a regular bipartite graph and for edge-colouring bipartite graphs, the solution of a problem of Erd?s and Rényi concerning lower bounds for the number of perfect matchings, and an improved lower bound for s dimer constant.作者: 煩躁的女人 時(shí)間: 2025-4-1 10:14
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generationible in linear time, implies the existence of bijection between rooted outerplanar maps with . nodes and bicolored rooted ordered trees with . nodes where all the nodes of the last branch are colored white. As a consequence, for rooted outerplanar maps of . nodes, we derive:
