2487 search results - page 16 / 498 » Partitions of Graphs into Trees |
SIAMJO
2008
13 years 9 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
HPCC
2005
Springer
14 years 2 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
RSCTC
2000
Springer
14 years 21 days ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
FCT
2005
Springer
14 years 2 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
EUROPAR
1999
Springer
14 years 1 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...