書(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é)科排名
作者: vibrant 時(shí)間: 2025-3-21 20:23 作者: Pcos971 時(shí)間: 2025-3-22 02:41
Computing the Tutte Polynomial on Graphs of Bounded Clique-Widththan that of tree-width. We show a subexponential algorithm (running in time exp.(..)) for computing the Tutte polynomial on cographs. The algorithm can be extended to a subexponential algorithm computing the Tutte polynomial on on all graphs of bounded clique-width. In fact, our algorithm computes the more general .-polynomial... 05C85, 68R10.作者: voluble 時(shí)間: 2025-3-22 06:23 作者: dragon 時(shí)間: 2025-3-22 10:02
Fang Zhi-yang,Sheng Zhi-yong,Ge Sheng-ded into each other by a sequence of triangle mutations – or triangle switches. This construction generalizes Ringel’s theorem on uniform pseudoline arrangements. Moreover, it applies to plane projections of spatial graphs encoded by rank 4 uniform oriented matroids.作者: nepotism 時(shí)間: 2025-3-22 14:16
Modern Trends in Fuzzy Graph Theoryt be .-hard. In this paper, we show that optimal broadcast domination is actually in ., and we give a polynomial time algorithm for solving the problem on arbitrary graphs, using a non standard approach.作者: nepotism 時(shí)間: 2025-3-22 19:00
Complete Graph Drawings Up to Triangle Mutationsd into each other by a sequence of triangle mutations – or triangle switches. This construction generalizes Ringel’s theorem on uniform pseudoline arrangements. Moreover, it applies to plane projections of spatial graphs encoded by rank 4 uniform oriented matroids.作者: 漂亮 時(shí)間: 2025-3-22 22:30 作者: 怪物 時(shí)間: 2025-3-23 03:31 作者: ADJ 時(shí)間: 2025-3-23 08:58 作者: 斜谷 時(shí)間: 2025-3-23 10:40
https://doi.org/10.1007/978-1-4615-0221-0anners of size .(log .), where . is the diameter of .,.– interval graphs have a 1-spanner with fewer than 2. – 2 edges..Furthermore, at the end of the paper we state other results on collective tree c-spanners for . > 1 and other more general graph classes.作者: Bumble 時(shí)間: 2025-3-23 14:17
Modern Trends in Applied Terrestrial Ecologys, and for planar line graphs. Now, the computational complexity of the stable cutset problem restricted to claw-free graphs and claw-free planar graphs is known for all bounds on the maximum degree..Moreover, we prove that the stable cutset problem remains .-complete for ..-free planar graphs of maximum degree five.作者: Dna262 時(shí)間: 2025-3-23 21:03 作者: 倫理學(xué) 時(shí)間: 2025-3-24 00:38 作者: 遣返回國(guó) 時(shí)間: 2025-3-24 04:42 作者: CAGE 時(shí)間: 2025-3-24 09:44
Roman Domination over Some Graph Classesumber of an interval graph can be computed in linear time. We also show that the Roman domination number of a cograph can be computed in linear time. Besides, we show that there are polynomial time algorithms for computing the Roman domination numbers of AT-free graphs and graphs with a .-octopus.作者: 猛擊 時(shí)間: 2025-3-24 12:29 作者: 詩(shī)集 時(shí)間: 2025-3-24 18:12 作者: 軌道 時(shí)間: 2025-3-24 22:42 作者: corn732 時(shí)間: 2025-3-25 02:17 作者: Mendacious 時(shí)間: 2025-3-25 04:29 作者: anchor 時(shí)間: 2025-3-25 08:59 作者: ARBOR 時(shí)間: 2025-3-25 14:58
https://doi.org/10.1007/978-3-642-11349-9than that of tree-width. We show a subexponential algorithm (running in time exp.(..)) for computing the Tutte polynomial on cographs. The algorithm can be extended to a subexponential algorithm computing the Tutte polynomial on on all graphs of bounded clique-width. In fact, our algorithm computes the more general .-polynomial... 05C85, 68R10.作者: Abduct 時(shí)間: 2025-3-25 19:14
https://doi.org/10.1007/978-3-319-49197-4 will characterise the potential maximal cliques of permutation graphs and give a characterisation of minimal triangulations of permutation graphs in terms of sets of potential maximal cliques. This results in linear-time algorithms for computing treewidth and minimum fill-in for permutation graphs.作者: Indicative 時(shí)間: 2025-3-25 22:14 作者: 疼死我了 時(shí)間: 2025-3-26 01:59
Approximating Rank-Width and Clique-Width Quicklyunded clique-width. It is known that many hard graph problems have polynomial-time algorithms for graphs of bounded clique-width, however, requiring a given decomposition corresponding to clique-width (.); they remove this requirement by constructing an algorithm that either outputs a rank-decomposi作者: 妨礙議事 時(shí)間: 2025-3-26 06:29
Computing the Tutte Polynomial on Graphs of Bounded Clique-Widthhose of bounded tree-width. The notion of clique-width extends the definition of cograhs (graphs without induced ..), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time exp.(..)) for computing the Tutte polynomial on cographs. The algorithm c作者: 小步舞 時(shí)間: 2025-3-26 09:41
Minimizing NLC-Width is NP-Complete at most . if its line graph has NLC-width or clique-width at most .. In [9] it is shown that a line graph has NLC-width at most .+2 and clique-width at most 2.+2 if the root graph has tree-width .. Using these bounds we show by a reduction from tree-width minimization that NLC-width minimization is作者: Brocas-Area 時(shí)間: 2025-3-26 15:20
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Times a minimal triangulation of .. A potential maximal clique of . is a set of vertices that induces a maximal clique in a minimal triangulation of .. We will characterise the potential maximal cliques of permutation graphs and give a characterisation of minimal triangulations of permutation graphs in 作者: 細(xì)胞膜 時(shí)間: 2025-3-26 18:56 作者: 怪物 時(shí)間: 2025-3-26 23:33
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms to three types: bijective, injective or surjective. If graph . has a homomorphism of given type to graph ., then we say that the degree refinement matrix of . is smaller than that of .. This way we obtain three partial orders. We present algorithms that will determine whether two matrices are compa作者: Foam-Cells 時(shí)間: 2025-3-27 04:40
Network Discovery and Verificationer of queries. A query at a vertex?. discovers (or verifies) all edges and non-edges whose endpoints have different distance from?.. In the network discovery problem, the edges and non-edges are initially unknown, and the algorithm must select the next query based only on the results of previous que作者: Celiac-Plexus 時(shí)間: 2025-3-27 07:00
Complete Graph Drawings Up to Triangle Mutationsdrawing when it is planar), and the sketch introduced by Courcelle (determining the drawing in general but assuming we know the order of the crossings on each edge). For a complete graph drawing, the subsketch is determined, through first order logic formulas, by the size, a corner of the drawing an作者: grotto 時(shí)間: 2025-3-27 11:54 作者: 南極 時(shí)間: 2025-3-27 16:29 作者: Parameter 時(shí)間: 2025-3-27 20:45
Induced Subgraphs of Bounded Degree and Bounded Treewidthnd every vertex in . has degree at most . in .. The order of . depends on ., ., ., and the order of .. With . = ., we obtain large sets of bounded degree vertices. With . = 0, we obtain large independent sets of bounded degree. In both these cases, our bounds on the order of . are tight. For bounded作者: 帶來(lái) 時(shí)間: 2025-3-28 00:48
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Timearious domination powers. Broadcast domination assigns a power .(.) ≥ 0 to each vertex . of a given graph, such that every vertex of the graph is within distance .(.) from some vertex . having .(.) ≥ 1. The optimal broadcast domination problem seeks to minimize the sum of the powers assigned to the 作者: 碎石頭 時(shí)間: 2025-3-28 04:56
Ultimate Generalizations of LexBFS and LEX Merfect elimination ordering) of a chordal graph, and corresponding algorithms which compute an meo (minimal elimination ordering) of a non-chordal graph..We express all known peo-computing search algorithms as instances of a generic algorithm called MLS (Maximal Label Search) and generalize Algorith作者: Flinch 時(shí)間: 2025-3-28 10:06
Adding an Edge in a Cographwo non-adjacent vertices . and .) of ., finds the minimum number of edges that need to be added to the edge set of . such that the resulting graph is a cograph and contains the edge .. The motivation for this problem comes from algorithms for the dynamic recognition and online maintenance of graphs;作者: NOTCH 時(shí)間: 2025-3-28 11:08 作者: happiness 時(shí)間: 2025-3-28 15:16
Modern Therapeutics in Rheumatic Diseasesunded clique-width. It is known that many hard graph problems have polynomial-time algorithms for graphs of bounded clique-width, however, requiring a given decomposition corresponding to clique-width (.); they remove this requirement by constructing an algorithm that either outputs a rank-decomposi作者: Indolent 時(shí)間: 2025-3-28 21:16
https://doi.org/10.1007/978-3-642-11349-9hose of bounded tree-width. The notion of clique-width extends the definition of cograhs (graphs without induced ..), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time exp.(..)) for computing the Tutte polynomial on cographs. The algorithm c作者: 闡明 時(shí)間: 2025-3-28 23:56 作者: 抵押貸款 時(shí)間: 2025-3-29 05:41
https://doi.org/10.1007/978-3-319-49197-4s a minimal triangulation of .. A potential maximal clique of . is a set of vertices that induces a maximal clique in a minimal triangulation of .. We will characterise the potential maximal cliques of permutation graphs and give a characterisation of minimal triangulations of permutation graphs in 作者: Semblance 時(shí)間: 2025-3-29 08:41
https://doi.org/10.1007/978-3-319-46261-5ex . with .(.) = 2. The weight of a Roman dominating function is defined to be .(.) = ∑..(.), and the minimum weight of a Roman dominating function on a graph . is called the Roman domination number of ...In this paper we answer an open problem mentioned in [2] by showing that the Roman domination n作者: 催眠藥 時(shí)間: 2025-3-29 13:58 作者: 鬧劇 時(shí)間: 2025-3-29 15:33
https://doi.org/10.1007/978-3-7643-8298-8er of queries. A query at a vertex?. discovers (or verifies) all edges and non-edges whose endpoints have different distance from?.. In the network discovery problem, the edges and non-edges are initially unknown, and the algorithm must select the next query based only on the results of previous que作者: 大包裹 時(shí)間: 2025-3-29 20:30
Fang Zhi-yang,Sheng Zhi-yong,Ge Sheng-dedrawing when it is planar), and the sketch introduced by Courcelle (determining the drawing in general but assuming we know the order of the crossings on each edge). For a complete graph drawing, the subsketch is determined, through first order logic formulas, by the size, a corner of the drawing an作者: Obligatory 時(shí)間: 2025-3-30 03:11
https://doi.org/10.1007/978-1-4615-0221-0 vertices .,. we require a tree .such that the distance between . and . in . is at most one more than their distance in .. We show that:.– there is no constant size set of collective tree 1-spanners for interval graphs (even unit interval graphs),.– interval graph . has a set of collective tree 1-sp作者: 造反,叛亂 時(shí)間: 2025-3-30 04:56
Modern Trends in Applied Terrestrial Ecologye same result has been known for ..-free graphs. Here we show how to decide this problem in polynomial time for (claw, ..)-free graphs and for a claw-free graph of maximum degree at most four. As a by-product we prove that the stable cutset problem is polynomially solvable for claw-free planar graph作者: GENRE 時(shí)間: 2025-3-30 09:30 作者: Perceive 時(shí)間: 2025-3-30 12:43 作者: 雪崩 時(shí)間: 2025-3-30 18:53 作者: 絆住 時(shí)間: 2025-3-30 22:10
https://doi.org/10.1007/978-1-4684-4913-6wo non-adjacent vertices . and .) of ., finds the minimum number of edges that need to be added to the edge set of . such that the resulting graph is a cograph and contains the edge .. The motivation for this problem comes from algorithms for the dynamic recognition and online maintenance of graphs;作者: VEST 時(shí)間: 2025-3-31 02:28
https://doi.org/10.1007/978-981-16-4955-4We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We also show – as a new result – that computing hypertree decompositions is fixed-parameter intractable.作者: 煩擾 時(shí)間: 2025-3-31 07:38
Applications of Communications TheoryThe goal of this paper is to present a brief survey of a collection of methods and results from the area of combinatorial search [1,8] focusing on graph reconstruction using queries of different type. The study is motivated by applications to genome sequencing.作者: 輪流 時(shí)間: 2025-3-31 13:14
Modern Theories of Income DistributionWe settle two conjectures on domination-search, a game proposed by Fomin et.al. [1], one in affirmative and the other in negative. The two results presented here are (1) domination search number can be greater than domination-target number, (2) domination search number for asteroidal-triple-free graphs is at most 2.作者: 灌溉 時(shí)間: 2025-3-31 16:44
https://doi.org/10.1007/978-3-319-60143-4We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average degree is underlined, which contributes to generalise and improve previous known results about improper colourings of planar graphs.作者: Infiltrate 時(shí)間: 2025-3-31 21:26 作者: Simulate 時(shí)間: 2025-4-1 00:46 作者: MIRE 時(shí)間: 2025-4-1 04:12
Domination Search on Graphs with Low Dominating-Target-NumberWe settle two conjectures on domination-search, a game proposed by Fomin et.al. [1], one in affirmative and the other in negative. The two results presented here are (1) domination search number can be greater than domination-target number, (2) domination search number for asteroidal-triple-free graphs is at most 2.作者: 偽善 時(shí)間: 2025-4-1 08:52
Channel Assignment and Improper Choosability of GraphsWe model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average degree is underlined, which contributes to generalise and improve previous known results about improper colourings of planar graphs.作者: 一再遛 時(shí)間: 2025-4-1 13:21
Graph-Theoretic Concepts in Computer Science978-3-540-31468-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 平項(xiàng)山 時(shí)間: 2025-4-1 14:48
