2487 search results - page 223 / 498 » Partitions of Graphs into Trees |
118
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
136
click to vote
NIPS
2001
15 years 5 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
147
click to vote
CCCG
1998
15 years 5 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
DAM
2006
15 years 4 months ago
2006
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
134
click to vote
JCT
2006
15 years 4 months ago
2006
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...