355 search results - page 46 / 71 » On Central Spanning Trees of a Graph |
155
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
162
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
173
click to vote
UAI
2000
15 years 7 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
159
click to vote
COLING
2002
15 years 6 months ago
2002
Text representation is a central task for any approach to automatic learning from texts. It requires a format which allows to interrelate texts even if they do not share content w...
172
Voted
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...