970 search results - page 49 / 194 » On encodings of spanning trees |
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
FLAIRS
2001
13 years 10 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
OPODIS
2004
13 years 10 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...
MICCAI
2005
Springer
14 years 9 months ago
2005
Springer
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
ISITA
2010
13 years 6 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...