2487 search results - page 7 / 498 » Partitions of Graphs into Trees |
JDA
2008
13 years 8 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
GD
1998
Springer
14 years 4 days ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...