Sciweavers

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

14

COCOC
1995

favoriteEmaildiscussreport

150views Combinatorics» more COCOC 1995»

On Central Spanning Trees of a Graph

13 years 8 months ago

On Central Spanning Trees of a Graph

Download mcs.uwsuper.edu

We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric diﬀerence of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central spanning tree is algorithmically diﬃcult and leads to an NP-complete problem.

Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke

Real-time Traffic

Central Spanning Tree | COCOC 1995 | Combinatorics | Maximal Distance | Spanning Tree |

claim paper

Related Content

» LinearTime Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs

» Modeling and solving the rooted distanceconstrained minimum spanning tree problem

» Minimum congestion spanning trees in planar graphs

» The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs

» Locally connected spanning trees on graphs

» Binomial Identities Generated by Counting Spanning Trees

» Addendum to The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem f...

» Hierarchical Minimum Spanning Trees for Lossy Image Set Compression

» An antbased algorithm for finding degreeconstrained minimum spanning tree

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	1995
Where	COCOC
Authors	Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke

Comments (0)