241 search results - page 12 / 49 » Degree Bounded Spanning Trees |
MFCS
1995
Springer
13 years 12 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
COMBINATORICA
2007
13 years 8 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
PCI
2005
Springer
14 years 1 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
IPPS
1999
IEEE
14 years 22 days ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
