Sciweavers

241 search results - page 13 / 49
» Degree Bounded Spanning Trees
Sort
View
APBC
2007
13 years 10 months ago
Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree
Martin Stig Stissing, Christian N. S. Pedersen, Th...
ALGORITHMICA
2010
82views more  ALGORITHMICA 2010»
13 years 8 months ago
Fractional Path Coloring in Bounded Degree Trees with Applications
Ioannis Caragiannis, Afonso Ferreira, Christos Kak...
DM
2006
61views more  DM 2006»
13 years 8 months ago
A degree bound on decomposable trees
Dominique Barth, Hervé Fournier
ICML
2010
IEEE
13 years 9 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
JUCS
2007
148views more  JUCS 2007»
13 years 8 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth