279 search results - page 24 / 56 » Degree-bounded minimum spanning trees |
PDCAT
2005
Springer
14 years 27 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
MICCAI
2005
Springer
14 years 8 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...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
IV
2002
IEEE
14 years 9 days ago
2002
IEEE
Visualization can facilitate the understanding of the structures of a collection of documents that are related to each other by links, such as citations in formal publications. We...
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...