Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

GC
2010
Springer

favoriteEmaildiscussreport

144views Applied Computing» more GC 2010»

Degree Bounded Spanning Trees

13 years 3 months ago

Degree Bounded Spanning Trees

Download www.is.kochi-u.ac.jp

In this paper, we give a suﬃcient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set S ⊆ V(G) of cardinality n(k − 1) + c + 2, there exists a vertex set X ⊆ S of cardinality k such that the degree sum of vertices

Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita

Real-time Traffic

Applied Computing | GC 2010 | N-connected Graph | Paper | Suﬃcient Condition |

claim paper

Related Content

» Minimum Bounded Degree Spanning Trees

» Approximating minimum bounded degree spanning trees to within one of optimal

» Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem

» Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem

» A NetworkFlow Technique for Finding LowWeight BoundedDegree Spanning Trees

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

» A Primal BranchandCut Algorithm for the DegreeConstrained Minimum Spanning Tree Problem

» Primaldual meets local search approximating MSTs with nonuniform degree bounds

» Efficient Construction of a Bounded Degree Spanner with Low Weight

Post Info
More Details (n/a)

Added	25 Jan 2011
Updated	25 Jan 2011
Type	Journal
Year	2010
Where	GC
Authors	Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita

Comments (0)