On 2-Connected Spanning Subgraphs with Low Maximum Degree
نویسندگان
چکیده
منابع مشابه
2-Connected spanning subgraphs with low maximum degree in locally planar graphs
In this paper, we prove that there exists a function a : N0 × R+ → N such that for each ε, if G is a 4-connected graph embedded on a surface of Euler genus k such that the face-width of G is at least a(k, ε), then G has a 2-connected spanning subgraph with maximum degree at most 3 such that the number of vertices of degree 3 is at most ε|V (G)|. This improves results due to Kawarabayshi, Nakamo...
متن کاملApproximating Bounded Degree Maximum Spanning Subgraphs∗
The bounded degree maximum spanning subgraph problem arising from wireless mesh networks is studied here. Given a connected graph G and a positive integer d ≥ 2, the problem aims to find a maximum spanning subgraph H of G with the constraint: for every vertex v of G, the degree of v in H, dH(v), is less than or equal to d. Here, a spanning subgraph is a connected subgraph which contains all the...
متن کاملFinding 2-edge connected spanning subgraphs
This paper studies the NP-hard problem of /nding a minimum size 2-edge connected spanning subgraph (2-ECSS). An algorithm is given that on an r-edge connected input graph G=(V; E) /nds a 2-ECSS of size at most |V |+(|E|−|V |)=(r−1). For r-regular, r-edge connected input graphs for r = 3, 4, 5 and 6, this gives approximation guarantees of 4 ; 4 3 ; 11 8 and 7 5 , respectively. c © 2003 Elsevier ...
متن کاملPacking of 2-Connected Spanning Subgraphs and Spanning Trees
We prove that every (6k + 2`, 2k)-connected simple graph contains k rigid and ` connected edgedisjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a theorem of Jordán [6] on packing of rigid spanning subgraphs. Both these results are generalizations of the classical result of Lovász and Yemini [9] saying that every 6-connected graph is rigid for which our approach p...
متن کاملOn finding highly connected spanning subgraphs
In the Survivable Network Design Problem (SNDP), the input is an edge-weighted (di)graph G and an integer ruv for every pair of vertices u, v ∈ V (G). The objective is to construct a subgraph H of minimum weight which contains ruv edge-disjoint (or node-disjoint) u-v paths. This is a fundamental problem in combinatorial optimization that captures numerous well-studied problems in graph theory a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1998
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1836