標(biāo)題: Titlebook: ; [打印本頁(yè)] 作者: Madison 時(shí)間: 2025-3-21 19:46
書(shū)目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)
書(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é)科排名
作者: CANON 時(shí)間: 2025-3-21 21:36 作者: Monocle 時(shí)間: 2025-3-22 03:50
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth,eewidth two or of pathwidth two. We show that the class of graphs of special treewidth at most two is closed under taking of minors, and give explicitly the obstruction set for this class. For .?≥?3, the class of graphs of special treewidth at most . is not closed under taking minors.作者: Angiogenesis 時(shí)間: 2025-3-22 08:18
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations, of .. We show that trees, cycles and complete graphs are ENPT graphs. We characterize the representations of chordless ENPT cycles that satisfy a certain assumption. Unlike chordless EPT cycles which have a unique representation, these representations turn out to be multiple and have a more complex作者: Brocas-Area 時(shí)間: 2025-3-22 12:21
https://doi.org/10.1007/978-3-642-94985-2st, we characterize the class of graphs constituting the image of Chroni and Nikolopoulos’s encoding function. Furthermore, we formulate a novel, linear-time decoding algorithm which detects and recovers from ill-intentioned removals of .?≤?2 edges. Finally, our results also include the detection of作者: Ganglion 時(shí)間: 2025-3-22 14:05 作者: Ganglion 時(shí)間: 2025-3-22 20:17 作者: 雪白 時(shí)間: 2025-3-23 00:12
https://doi.org/10.1007/978-3-663-01088-3 of .. We show that trees, cycles and complete graphs are ENPT graphs. We characterize the representations of chordless ENPT cycles that satisfy a certain assumption. Unlike chordless EPT cycles which have a unique representation, these representations turn out to be multiple and have a more complex作者: 得體 時(shí)間: 2025-3-23 04:01 作者: fixed-joint 時(shí)間: 2025-3-23 05:32
Overview of New Approaches for Approximating TSP,y explaining the algorithm of Oveis Gharan et al.?[1] that has strong similarities to Christofides’ famous 3/2-approximation algorithm. We then explain the main ideas behind an alternative approach introduced by M?mke and the author?[2]. The new ingredient in our approach is that it allows for the r作者: magenta 時(shí)間: 2025-3-24 00:46
Towards a Provably Resilient Scheme for Graph-Based Watermarking,ownership and therefore discouraging piracy. Graph-based watermarking schemes comprise an encoding algorithm, which translates a given number (the identifier, usually a positive integer) onto some appropriately tailored graph (the watermark), and a decoding algorithm, which extracts the original ide作者: 補(bǔ)助 時(shí)間: 2025-3-24 05:08
The Normal Graph Conjecture for Classes of Sparse Graphs,very clique in . intersects every stable set in ...Normal graphs can be considered as closure of perfect graphs by means of co-normal products and graph entropy. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs (Strong Perfect G作者: Ganglion 時(shí)間: 2025-3-24 10:15
On the Parameterized Complexity of Computing Graph Bisections,ing the two vertex sets. . has been thoroughly studied in the past. However, only few results have been published that consider the parameterized complexity of this problem..We show that . is FPT w.r.t. the minimum cut size if there is an optimum bisection that cuts into a given constant number of c作者: tangle 時(shí)間: 2025-3-24 13:54
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth, vertex ., the bags containing . form a rooted path in decomposition tree. We resolve an open problem by Courcelle, and show that an algorithm by Bodlaender and Kloks?[7] can be modified to obtain for each fixed ., a linear time algorithm that decides if the special treewidth of a given graph is at 作者: 舞蹈編排 時(shí)間: 2025-3-24 15:53 作者: intolerance 時(shí)間: 2025-3-24 22:03 作者: 世俗 時(shí)間: 2025-3-25 02:20 作者: Accomplish 時(shí)間: 2025-3-25 07:16
Equilateral L-Contact Graphs,phs, drawing connections to Schnyder realizers and canonical orders of maximally planar graphs. We show that every contact system of L’s can always be converted to an equivalent one with equilateral L’s. This can be used to show a stronger version of a result of Thomassen, namely, that every planar 作者: dearth 時(shí)間: 2025-3-25 08:39 作者: elastic 時(shí)間: 2025-3-25 12:26 作者: Herd-Immunity 時(shí)間: 2025-3-25 18:54 作者: GROUP 時(shí)間: 2025-3-25 23:23 作者: 行業(yè) 時(shí)間: 2025-3-26 02:16 作者: peak-flow 時(shí)間: 2025-3-26 07:31 作者: 玩笑 時(shí)間: 2025-3-26 09:57
https://doi.org/10.1007/978-1-349-12439-8d social sciences, in chemistry and physics have tree-like structures from a metric point of view. A number of graph parameters trying to capture this phenomenon and to measure these tree-like structures were proposed; most notable ones being the ., ., ., ., Gromov’s . of a graph, and . and . in a .作者: Morphine 時(shí)間: 2025-3-26 14:13
https://doi.org/10.1007/978-1-4842-1688-0y explaining the algorithm of Oveis Gharan et al.?[1] that has strong similarities to Christofides’ famous 3/2-approximation algorithm. We then explain the main ideas behind an alternative approach introduced by M?mke and the author?[2]. The new ingredient in our approach is that it allows for the r作者: 慢慢流出 時(shí)間: 2025-3-26 20:23
https://doi.org/10.1007/978-1-4612-1974-3ath-width of . plus two, provided that . contains a path of length three. It follows that both linear rank-width and linear clique-width of forests can be computed in linear time. Using our characterization of linear rank-width of forests, we determine the set of minimal excluded acyclic vertex-mino作者: 性學(xué)院 時(shí)間: 2025-3-26 22:58
https://doi.org/10.1007/978-3-642-29302-3 with near colors imply the edge between them is present and pairs of vertices with far colors imply the edge is absent. Not all planar graphs are threshold-colorable, but several subclasses, such as trees, some planar grids, and planar graphs with no short cycles can always be threshold-colored. Us作者: 修飾語(yǔ) 時(shí)間: 2025-3-27 04:46 作者: Lacerate 時(shí)間: 2025-3-27 07:55
https://doi.org/10.1007/978-3-642-94985-2ownership and therefore discouraging piracy. Graph-based watermarking schemes comprise an encoding algorithm, which translates a given number (the identifier, usually a positive integer) onto some appropriately tailored graph (the watermark), and a decoding algorithm, which extracts the original ide作者: 自負(fù)的人 時(shí)間: 2025-3-27 11:32
https://doi.org/10.1007/978-3-663-08773-1very clique in . intersects every stable set in ...Normal graphs can be considered as closure of perfect graphs by means of co-normal products and graph entropy. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs (Strong Perfect G作者: 老巫婆 時(shí)間: 2025-3-27 13:43 作者: 治愈 時(shí)間: 2025-3-27 18:54 作者: 令人悲傷 時(shí)間: 2025-3-27 23:46
https://doi.org/10.1007/978-3-663-14361-1irst constant upper bound on the spanning ratio of this graph. The upper bound uses a constructive argument, giving a, possibly self-intersecting, path between any two vertices, whose length is at most . times the Euclidean distance between the vertices. We also give a lower bound on the spanning ra作者: 言行自由 時(shí)間: 2025-3-28 05:53 作者: FIS 時(shí)間: 2025-3-28 08:36 作者: 阻擋 時(shí)間: 2025-3-28 14:28
https://doi.org/10.1007/978-3-658-36300-0phs, drawing connections to Schnyder realizers and canonical orders of maximally planar graphs. We show that every contact system of L’s can always be converted to an equivalent one with equilateral L’s. This can be used to show a stronger version of a result of Thomassen, namely, that every planar 作者: gentle 時(shí)間: 2025-3-28 16:23 作者: 果仁 時(shí)間: 2025-3-28 18:58
https://doi.org/10.1007/b138111at admit non-negative real weights associated to their vertices so that a set of vertices is a total dominating set if and only if the sum of the corresponding weights exceeds a certain threshold. We show that these graphs, which we call total domishold graphs, form a non-hereditary class of graphs 作者: Impugn 時(shí)間: 2025-3-29 02:53
https://doi.org/10.1007/978-3-322-88619-4inds one with minimum number of edges. We also show that it is . to decide whether a connected .-vertex graph has a square root with at most .???1?+?. edges when this problem is parameterized by .. Finally, we give an exact exponential time algorithm for the problem of finding a square root with max作者: 中止 時(shí)間: 2025-3-29 07:08 作者: 轉(zhuǎn)向 時(shí)間: 2025-3-29 09:52 作者: 吹氣 時(shí)間: 2025-3-29 12:26
Modularisierung von IT-Dienstleistungene that .. To demonstrate the tightness of this bound, we notice that the above inequality implies .(.)?∈?Ω((log. .).), where . is any positive constant smaller than 1, and describe an infinite family of 3-connected planar graphs for which .(.)?∈?.(log.). As a byproduct of our research, we prove a re作者: 惡意 時(shí)間: 2025-3-29 17:43
Graph-Theoretic Concepts in Computer Science978-3-642-45043-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Parley 時(shí)間: 2025-3-29 20:37
https://doi.org/10.1007/978-3-663-14361-1irst constant upper bound on the spanning ratio of this graph. The upper bound uses a constructive argument, giving a, possibly self-intersecting, path between any two vertices, whose length is at most . times the Euclidean distance between the vertices. We also give a lower bound on the spanning ratio of . (11.-17) ≈ 3.798.作者: Admire 時(shí)間: 2025-3-30 03:34
https://doi.org/10.1007/978-3-663-08152-4+?.) time algorithm for computing the scattering number of an interval graph with . vertices and . edges, which improves the .(. .) time bound of Kratsch, Kloks and Müller. As a consequence of our two results the maximum . for which an interval graph is .-Hamilton-connected can be computed in .(.?+?.) time.作者: 絆住 時(shí)間: 2025-3-30 04:52 作者: FEAT 時(shí)間: 2025-3-30 11:50 作者: 山間窄路 時(shí)間: 2025-3-30 13:43
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs,+?.) time algorithm for computing the scattering number of an interval graph with . vertices and . edges, which improves the .(. .) time bound of Kratsch, Kloks and Müller. As a consequence of our two results the maximum . for which an interval graph is .-Hamilton-connected can be computed in .(.?+?.) time.作者: 變形詞 時(shí)間: 2025-3-30 18:22 作者: 透明 時(shí)間: 2025-3-30 21:45
https://doi.org/10.1007/978-3-642-29302-3ing these results we obtain unit-cube contact representation of several subclasses of planar graphs. We show the NP-completeness for two variants of the threshold coloring problem and describe a polynomial-time algorithm for another.作者: 有危險(xiǎn) 時(shí)間: 2025-3-31 01:33 作者: Canopy 時(shí)間: 2025-3-31 07:24
Modularisierung von IT-Dienstleistungensult of independent interest: Every 3-connected planar graph with . vertices contains an induced subgraph that is outerplanar and connected and that contains at least . vertices. The proofs in the paper are constructive and give rise to .(.)-time algorithms.作者: Physiatrist 時(shí)間: 2025-3-31 12:28
Threshold-Coloring and Unit-Cube Contact Representation of Graphs,ing these results we obtain unit-cube contact representation of several subclasses of planar graphs. We show the NP-completeness for two variants of the threshold coloring problem and describe a polynomial-time algorithm for another.作者: Phagocytes 時(shí)間: 2025-3-31 15:10
Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees,le for general trees. We resolve this open problem by developing an .(3. .)-time parameterized algorithm for the problem on general trees. Our techniques on tree structures also lead to a polynomial-time approximation algorithm of ratio 3 for the problem, giving the first constant-ratio approximation algorithm for the problem on general trees.作者: Bother 時(shí)間: 2025-3-31 20:25 作者: 宴會(huì) 時(shí)間: 2025-3-31 22:02
https://doi.org/10.1007/978-1-349-12439-8 graphs. We discuss these parameters and recently established relationships between them for unweighted and undirected graphs; it turns out that all these parameters are at most constant or logarithmic factors apart from each other. We give inequalities describing their relationships and discuss consequences for some optimization problems.作者: ESPY 時(shí)間: 2025-4-1 05:10
https://doi.org/10.1007/978-3-658-36300-0s and show that these are equivalent to homothetic triangle contact representations of maximally planar graphs. We believe that this new interpretation of the problem might allow for efficient algorithms to find homothetic triangle contact representations, that do not use Schramm’s monster packing theorem.作者: MORT 時(shí)間: 2025-4-1 08:34 作者: 分發(fā) 時(shí)間: 2025-4-1 12:01
Tree-Like Structures in Graphs: A Metric Point of View, graphs. We discuss these parameters and recently established relationships between them for unweighted and undirected graphs; it turns out that all these parameters are at most constant or logarithmic factors apart from each other. We give inequalities describing their relationships and discuss consequences for some optimization problems.作者: 入會(huì) 時(shí)間: 2025-4-1 16:08 作者: 平淡而無(wú)味 時(shí)間: 2025-4-1 18:47
Linear Separation of Total Dominating Sets in Graphs,al domishold graphs, and obtain partial results towards a characterization of graphs in which the above property holds in a hereditary sense. Our characterization in the case of split graphs is obtained by studying a new family of hypergraphs, defined similarly as the Sperner hypergraphs, which may be of independent interest.作者: 弓箭 時(shí)間: 2025-4-1 23:19 作者: 梯田 時(shí)間: 2025-4-2 05:25
https://doi.org/10.1007/978-3-662-57712-7if the graph contains a single source and a single sink but only for the plane and standing cylinder..Here we show that there is a linear-time algorithm to test whether a strongly connected graph is upward planar on the rolling cylinder. For our algorithm, we introduce dual and directed SPQR-trees as extensions of SPQR-trees.作者: 粗糙濫制 時(shí)間: 2025-4-2 09:05 作者: FECT 時(shí)間: 2025-4-2 11:17
