255 search results - page 1 / 51 » Spanning Trees and Function Classes |
COMBINATORICS
2002
13 years 10 months ago
2002
If G = Kn is the complete graph, the classical Pr
SODA
2012
ACM
12 years 1 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
MICCAI
2005
Springer
14 years 12 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...
NETWORKS
2008
13 years 11 months ago
2008
In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...