書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度學科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學科排名
作者: 排名真古怪 時間: 2025-3-21 23:59 作者: Ventricle 時間: 2025-3-22 01:01
Markus Mangiapane,Roman P. Büchlerstructural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm [14]. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust .(...)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.作者: 你敢命令 時間: 2025-3-22 05:53
https://doi.org/10.1007/978-3-642-36132-6ight independent set problem (selecting a set of disjoint disks in the plane of maximum total weight) in disk graphs and for the maximum bisection problem (finding a partition of the vertex set into two subsets of equal cardinality with maximum number of edges between the subsets) in unit-disk graphs.作者: 非秘密 時間: 2025-3-22 09:45 作者: Stress-Fracture 時間: 2025-3-22 14:17
NLC-2 Graph Recognition and Isomorphism,structural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm [14]. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust .(...)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.作者: Stress-Fracture 時間: 2025-3-22 19:21
Approximation Algorithms for Geometric Intersection Graphs,ight independent set problem (selecting a set of disjoint disks in the plane of maximum total weight) in disk graphs and for the maximum bisection problem (finding a partition of the vertex set into two subsets of equal cardinality with maximum number of edges between the subsets) in unit-disk graphs.作者: 故意 時間: 2025-3-23 00:12
https://doi.org/10.1007/978-3-663-10832-0A linear-time algorithm that does not need a planar embedding is presented for the problem of computing two vertex-disjoint paths, each with prescribed endpoints, in an undirected 3-connected planar graph.作者: 撕裂皮肉 時間: 2025-3-23 02:49 作者: 刪除 時間: 2025-3-23 09:04 作者: breadth 時間: 2025-3-23 13:05 作者: Priapism 時間: 2025-3-23 15:01
Graph Searching in a Crime Wave,r model is defined for robbers that are visible (the cops know their position) and active (able to move at every turn) but is easily adapted to other common variants of the game. The game with many robbers is non-monotone: more cops are needed if their moves are restricted so as to monotonically dec作者: SLAG 時間: 2025-3-23 20:29 作者: NOMAD 時間: 2025-3-24 00:38 作者: 熱心助人 時間: 2025-3-24 04:33 作者: 輕快帶來危險 時間: 2025-3-24 07:51
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions,hs over .(2). We propose here algebraic operations on graphs that characterize rank-width. For algorithmic purposes, it is important to represent graphs by balanced terms. We give a unique theorem that generalizes several “balancing theorems” for tree-width and clique-width. New results are obtained作者: 忘恩負義的人 時間: 2025-3-24 12:06
The Clique-Width of Tree-Power and Leaf-Power Graphs,(1.) the .-power graph of a tree has NLC-width at most .?+?2 and clique-width at most ., (2.) the .-leaf-power graph of a tree has NLC-width at most . and clique-width at most ., and (3.) the .-power graph of a graph of tree-width . has NLC-width at most (.?+?1).??1 and clique-width at most 2·(.?+?1作者: 拾落穗 時間: 2025-3-24 18:36
NLC-2 Graph Recognition and Isomorphism,structural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm [14]. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust .(...)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is 作者: travail 時間: 2025-3-24 19:38
A Characterisation of the Minimal Triangulations of Permutation Graphs,., graphs that are both comparability and cocomparability graphs, it is known that minimal triangulations are interval graphs. We (negatively) answer the question whether every interval graph is a minimal triangulation of a permutation graph. We give a non-trivial characterisation of the class of in作者: Encapsulate 時間: 2025-3-25 00:25
The 3-Steiner Root Problem,ge set where ..(.,.) is the distance between . and . in graph .. The . on a graph . asks for a tree . with .(.)???.(.) and . is the subgraph of .. induced by .(.). If such a tree . exists, we call it a . of .. This paper gives a linear time algorithm for the 3-Steiner root problem. Consider an unroo作者: fiction 時間: 2025-3-25 05:13 作者: 擦掉 時間: 2025-3-25 08:18 作者: 轉(zhuǎn)折點 時間: 2025-3-25 15:05 作者: NUDGE 時間: 2025-3-25 19:22
,An Equivalent Version of the Caccetta-H?ggkvist Conjecture in an Online Load Balancing Problem, a method by Crescenzi . (2004). We show that an exact analysis of their competitive ratio on certain “uniform” instances would resolve a fundamental conjecture by Caccetta and H?ggkvist (1978). The conjecture is that any digraph on . nodes and minimum outdegree . must contain a directed cycle invol作者: recede 時間: 2025-3-25 22:48 作者: 敲詐 時間: 2025-3-26 02:56 作者: cacophony 時間: 2025-3-26 07:52 作者: 北京人起源 時間: 2025-3-26 12:24
Moderner Tunnelbau bei der Münchner U-Bahnphs. (A set . of vertices of a graph . is called (.,.). if for every vertex .?∈?., |.?∩?.(.)|?∈?., and for every .???., |.?∩?.(.)|?∈?., where . and . are sets of nonnegative integers and .(.) denotes the open neighborhood of the vertex . in ..) It was known that for any two nonempty finite sets . an作者: 去掉 時間: 2025-3-26 15:28
https://doi.org/10.1007/978-3-322-95052-9ch a way that (.)?∈?. if and only if |..?∩?..|?≥?min (..,..). No algorithm for recognizing tolerance graphs in general is known. In this paper we present an .(.?+?.) algorithm for recognizing tolerance graphs that are also bipartite, where . and . are the number vertices and edges of the graph, resp作者: 強行引入 時間: 2025-3-26 18:57 作者: Pudendal-Nerve 時間: 2025-3-26 21:24 作者: surrogate 時間: 2025-3-27 01:58 作者: sphincter 時間: 2025-3-27 08:12 作者: Foam-Cells 時間: 2025-3-27 09:25
https://doi.org/10.1007/978-3-476-04307-8hs over .(2). We propose here algebraic operations on graphs that characterize rank-width. For algorithmic purposes, it is important to represent graphs by balanced terms. We give a unique theorem that generalizes several “balancing theorems” for tree-width and clique-width. New results are obtained作者: DNR215 時間: 2025-3-27 14:03
https://doi.org/10.1007/978-3-658-40933-3(1.) the .-power graph of a tree has NLC-width at most .?+?2 and clique-width at most ., (2.) the .-leaf-power graph of a tree has NLC-width at most . and clique-width at most ., and (3.) the .-power graph of a graph of tree-width . has NLC-width at most (.?+?1).??1 and clique-width at most 2·(.?+?1作者: Panther 時間: 2025-3-27 21:35 作者: LARK 時間: 2025-3-28 00:45
Markus Mangiapane,Roman P. Büchler., graphs that are both comparability and cocomparability graphs, it is known that minimal triangulations are interval graphs. We (negatively) answer the question whether every interval graph is a minimal triangulation of a permutation graph. We give a non-trivial characterisation of the class of in作者: Needlework 時間: 2025-3-28 03:24 作者: Hyperlipidemia 時間: 2025-3-28 06:29 作者: CHASM 時間: 2025-3-28 11:08
https://doi.org/10.1007/978-3-662-08810-4planar drawings of planar graphs can be realized in .(..) area [9]. In this paper we consider families of DAGs that naturally arise in practice, like DAGs whose underlying graph is a tree (.), is a bipartite graph (.), or is an outerplanar graph (.). Concerning ., we show that optimal .(. log.) area作者: 業(yè)余愛好者 時間: 2025-3-28 15:12 作者: 直言不諱 時間: 2025-3-28 20:59
https://doi.org/10.1007/978-3-540-72941-9 a method by Crescenzi . (2004). We show that an exact analysis of their competitive ratio on certain “uniform” instances would resolve a fundamental conjecture by Caccetta and H?ggkvist (1978). The conjecture is that any digraph on . nodes and minimum outdegree . must contain a directed cycle invol作者: 光滑 時間: 2025-3-28 23:57
https://doi.org/10.1007/978-3-662-65584-9 whenever the corresponding colourings differ on precisely one vertex of?.. We consider the following question : given?., how easily can we decide whether or not?. is connected? We show that the 3-colour graph of a 3-chromatic graph is never connected, and characterise the bipartite graphs for which作者: 繼承人 時間: 2025-3-29 04:03 作者: Strength 時間: 2025-3-29 09:06
https://doi.org/10.1007/978-3-540-87399-0ng trees, bipartite perfect matchings, and ice models. The notion of an .-orientation unifies many different combinatorial structures, including the afore mentioned. We ask for the number of .-orientations and also for special instances thereof, such as Schnyder woods and bipolar orientations. The m作者: 可行 時間: 2025-3-29 15:18 作者: giggle 時間: 2025-3-29 18:55
https://doi.org/10.1007/978-3-663-13176-2ategies is simplified by taking into account that there exist some that never backtrack..Fomin . (2005) introduced an important graph searching variant, called ., that unifies visible and invisible graph searching. In this variant, the fugitive is invisible, and the searchers can query an oracle tha作者: 享樂主義者 時間: 2025-3-29 21:42 作者: CRAFT 時間: 2025-3-30 00:00
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs,n flavor of existentionality - we are not able to characterize such pairs (.,.) by a structural description, but at least we can provide a recursive algorithm for their recognition. If . contains the 0 element, every graph contains a (.,.)-dominating set (the empty one), and so the nontrivial questi作者: 創(chuàng)新 時間: 2025-3-30 04:41
Monotonicity of Non-deterministic Graph Searching,ategies is simplified by taking into account that there exist some that never backtrack..Fomin . (2005) introduced an important graph searching variant, called ., that unifies visible and invisible graph searching. In this variant, the fugitive is invisible, and the searchers can query an oracle tha作者: corporate 時間: 2025-3-30 11:17
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Grants of planar upward drawings of several families of directed trees, we show how the results obtained for trees can be exploited to determine asymptotic optimal values for the area occupation of planar upward drawings of . and ..作者: figment 時間: 2025-3-30 12:50 作者: 臭了生氣 時間: 2025-3-30 19:13 作者: 不能仁慈 時間: 2025-3-30 23:25 作者: 訓誡 時間: 2025-3-31 01:00
https://doi.org/10.1007/978-3-662-65584-9?. is connected. We also show that the problem of deciding the connectedness of the 3-colour graph of a bipartite graph is coNP-complete, but that restricted to planar bipartite graphs, the question is answerable in polynomial time.作者: 拾落穗 時間: 2025-3-31 05:58
Tree-Width and Optimization in Bounded Degree Graphs,ph problems – dominating set, independent dominating set and induced matching – and obtain several results toward revealing the equivalency between boundedness of the tree-width and polynomial-time solvability of these problems in bounded degree graphs.作者: aqueduct 時間: 2025-3-31 11:06 作者: 高歌 時間: 2025-3-31 15:44
On Finding Graph Clusterings with Maximum Modularity,hardness of maximizing modularity both in the general case and with the restriction to cuts, and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomaration approach.作者: Dealing 時間: 2025-3-31 20:55
Mixing 3-Colourings in Bipartite Graphs,?. is connected. We also show that the problem of deciding the connectedness of the 3-colour graph of a bipartite graph is coNP-complete, but that restricted to planar bipartite graphs, the question is answerable in polynomial time.作者: GAVEL 時間: 2025-4-1 01:17
