書目名稱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讀者反饋學科排名
作者: Fortify 時間: 2025-3-22 00:12 作者: rheumatology 時間: 2025-3-22 03:48 作者: 反復拉緊 時間: 2025-3-22 08:08 作者: 輕率看法 時間: 2025-3-22 11:15
The (Weighted) Metric Dimension of Graphs: Hard and Easy Caseste wheels extend known polynomial time algorithms for the unweighted version, whereas the other results are the first known polynomial time algorithms for these classes of graphs even for the unweighted version. Next, we extend the set of graph classes for which computing the unweighted metric dimen作者: 安裝 時間: 2025-3-22 14:29
https://doi.org/10.1007/978-3-642-68736-5llows. Given an edge colored graph (here we allow ≥?2 colors) a trail (vertices may repeat but not edges) is called . when successive edges have different colors. Given a set of vertices called ., the . problem is to find an alternating trail connecting distinct terminals, if one exists. By reductio作者: 安裝 時間: 2025-3-22 18:20 作者: 破裂 時間: 2025-3-22 22:01
Thomas Spengler,Olga Metzger,Tobias Volkmerwith a minimum number of blocking pairs or a minimum total blocking value, respectively, are .-hard. Finally, we prove that the variant of the first problem, in which the number of blocking pairs must be minimized with respect to some fixed matching, is .-hard, whereas this variant of the second pro作者: 深淵 時間: 2025-3-23 04:25
https://doi.org/10.1007/978-3-642-99598-9ample, the variant with no restrictions on moves is represented by the Complete .. graph; the variant in which the pegs constitute a cycle and moves are allowed only in one direction — by the uni-directional graph ....For all 3-peg variants, the number of moves grows exponentially fast with .. Howev作者: Glower 時間: 2025-3-23 08:30 作者: 有機體 時間: 2025-3-23 11:44
Martin Charles Golumbic,Michal Stern,Gila Morgenst作者: Anthem 時間: 2025-3-23 17:07
Account on Intervalsclass of graphs are well understood, some old problems are still open. One such problem is the so-called interval count problem, which asks for the minimum number of different interval lengths needed to represent a given interval graph. Whereas graphs of interval count 1 coincide with unit interval 作者: LIMIT 時間: 2025-3-23 19:55 作者: Bereavement 時間: 2025-3-24 01:24 作者: 滲透 時間: 2025-3-24 03:44 作者: 不近人情 時間: 2025-3-24 08:32
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphsdates back to 1984. More recently, Chudnovsky and Seymour [3] introduced a composition operation, strip-composition, in order to define their structural results for claw-free graphs; however, this composition operation is general and applies to non-claw-free graphs as well. In this paper, we show th作者: Obsequious 時間: 2025-3-24 13:59 作者: accomplishment 時間: 2025-3-24 18:30
Optimization Problems in Dotted Interval Graphsus classical graph-theoretic optimization problems in .-DI graphs of arbitrarily, but fixed, ...We show that ., ., and . can be solved in polynomial time in this graph class, answering an open question posed by Jiang .. We also show that . can be approximated within a factor of (1?+?.) for any .?>?0作者: liposuction 時間: 2025-3-24 19:49
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)ne. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple interval graphs. The MAXIMUM CLIQUE problem, or the problem of finding the size of the maximum clique, is known to be NP-complete for .-interval graphs when .?≥?3 and polynomial-time solvable when .?=?1. The pro作者: WATER 時間: 2025-3-25 00:47 作者: Statins 時間: 2025-3-25 06:46
Which Multi-peg Tower of Hanoi Problems Are Exponential?latively new approach discusses a graph’s . as a measure for the graph’s performance in some areas, such as communication. This paper deals with Tower of Hanoi variants played on digraphs, and proves they can be grouped into two categories, based on a certain connectivity attribute to be defined in 作者: 溺愛 時間: 2025-3-25 07:45 作者: MUTE 時間: 2025-3-25 15:08 作者: 泥沼 時間: 2025-3-25 15:52 作者: FACET 時間: 2025-3-25 22:53 作者: 躲債 時間: 2025-3-26 03:05
On the Minimum Degree Up to Local Complementation: Bounds and Complexitys quantity which plays an important role in quantum computation and quantum error correcting codes..First, we show that the local minimum degree of the Paley graph of order . is greater than ., which is, up to our knowledge, the highest known bound on an explicit family of graphs. Probabilistic meth作者: Acetaldehyde 時間: 2025-3-26 06:44 作者: 暗語 時間: 2025-3-26 12:11 作者: Microgram 時間: 2025-3-26 14:47 作者: filial 時間: 2025-3-26 17:52 作者: 綁架 時間: 2025-3-26 22:43 作者: Peristalsis 時間: 2025-3-27 02:19
https://doi.org/10.1007/978-3-642-68736-5onnegative real vector on the edges is said to be . if the red sum equals the blue sum at every vertex. A . is a subgraph whose characteristic vector is balanced (i.e., red degree equals blue degree at every vertex). By a . (respectively, .) of cycles we mean a nonnegative integral (respectively, no作者: 破譯密碼 時間: 2025-3-27 06:42
https://doi.org/10.1007/978-3-322-92979-2decompositions in terms of clique separators. Computing a minimal triangulation can be done in .(.) time and much effort has been invested to improve this time bound for general and special graphs. We propose a recursive algorithm which works for general graphs and runs in linear time if the input i作者: HUMP 時間: 2025-3-27 12:16
https://doi.org/10.1007/978-3-322-90466-9dates back to 1984. More recently, Chudnovsky and Seymour [3] introduced a composition operation, strip-composition, in order to define their structural results for claw-free graphs; however, this composition operation is general and applies to non-claw-free graphs as well. In this paper, we show th作者: floaters 時間: 2025-3-27 16:59 作者: Parabola 時間: 2025-3-27 21:30
https://doi.org/10.1007/978-3-8349-8097-7us classical graph-theoretic optimization problems in .-DI graphs of arbitrarily, but fixed, ...We show that ., ., and . can be solved in polynomial time in this graph class, answering an open question posed by Jiang .. We also show that . can be approximated within a factor of (1?+?.) for any .?>?0作者: armistice 時間: 2025-3-28 01:16
https://doi.org/10.1007/978-3-8349-9318-2ne. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple interval graphs. The MAXIMUM CLIQUE problem, or the problem of finding the size of the maximum clique, is known to be NP-complete for .-interval graphs when .?≥?3 and polynomial-time solvable when .?=?1. The pro作者: 悠然 時間: 2025-3-28 05:38
Thomas Spengler,Olga Metzger,Tobias Volkmern. A solution is a matching . with a vector . that satisfies ..?+?..?=?.(.) for all .?∈?. and ..?=?0 for all . unmatched in .. A solution is stable if it prevents blocking pairs, i.e., pairs of adjacent vertices . and . with ..?+?..?
作者: 拱墻 時間: 2025-3-28 08:27
https://doi.org/10.1007/978-3-642-99598-9latively new approach discusses a graph’s . as a measure for the graph’s performance in some areas, such as communication. This paper deals with Tower of Hanoi variants played on digraphs, and proves they can be grouped into two categories, based on a certain connectivity attribute to be defined in 作者: 有花 時間: 2025-3-28 11:15 作者: magnanimity 時間: 2025-3-28 14:37
https://doi.org/10.1007/978-3-322-93200-6in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.作者: LATER 時間: 2025-3-28 20:33 作者: 物質(zhì) 時間: 2025-3-29 01:16
https://doi.org/10.1007/978-3-658-38171-4t least 2 and vertices in distance 2 get different labels. The main result of the paper is an algorithm finding an optimal .(2,1)-labeling of a graph (i.e. an .(2,1)-labeling in which the largest label is the least possible) in time ..(7.4922.) and polynomial space. Moreover, a new interesting extre作者: 甜食 時間: 2025-3-29 03:30 作者: 種族被根除 時間: 2025-3-29 07:58 作者: 細節(jié) 時間: 2025-3-29 13:32 作者: SMART 時間: 2025-3-29 17:11 作者: maladorit 時間: 2025-3-29 22:43
Account on Intervalsnimum number of different interval lengths needed to represent a given interval graph. Whereas graphs of interval count 1 coincide with unit interval graphs, not much is known about graphs of interval count 2. In this talks we will survey some recent results and discuss several open problems related to interval count 2 graphs.作者: 夾死提手勢 時間: 2025-3-30 00:43
-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Arear specific sub-families of partial .-trees, we present ad-hoc algorithms that compute .-quasi planar drawings in linear area, such that . is significantly reduced with respect to the general result. Finally, we compare the notion of .-quasi planarity with the notion of .-planarity, where each edge is allowed to be crossed at most . times.作者: palette 時間: 2025-3-30 04:02
On the Stable Degree of Graphsgree is hard to approximate. For asteroidal triple-free graphs and graphs of bounded asteroidal number the stable degree can be computed in polynomial time. For graphs in these classes the treewidth is bounded from below and above in terms of the stable degree.作者: PALMY 時間: 2025-3-30 10:59 作者: febrile 時間: 2025-3-30 14:44
https://doi.org/10.1007/978-3-322-90466-9at a . of a perfect strip-composed graph, with the basic graphs belonging to a class ., can be found in polynomial time, provided that the . problem can be solved on . in polynomial time. We also design a new, more efficient, combinatorial algorithm for the . problem on strip-composed claw-free perfect graphs.作者: audiologist 時間: 2025-3-30 20:28
Moderne Organisationstheorien 2 graph classes for all but finitely many cases, whenever neither of the forbidden graphs is a clique, a pan, or a complement of these graphs. Further reducing the remaining open cases we show that (with respect to graph isomorphism) forbidding a pan is equivalent to forbidding a clique of size three.作者: 鳥籠 時間: 2025-3-30 22:59 作者: absolve 時間: 2025-3-31 01:11 作者: 壟斷 時間: 2025-3-31 07:09
Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerancet-tolerant, namely, reinforcing it so that following a failure event, its surviving part continues to satisfy the requirements. The talk will distinguish between two types of fault-tolerance, termed rigid and competitive fault tolerance, compare these two notions, and illustrate them on a number of examples.作者: CUMB 時間: 2025-3-31 11:44
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphsat a . of a perfect strip-composed graph, with the basic graphs belonging to a class ., can be found in polynomial time, provided that the . problem can be solved on . in polynomial time. We also design a new, more efficient, combinatorial algorithm for the . problem on strip-composed claw-free perfect graphs.
