2487 search results - page 25 / 498 » Partitions of Graphs into Trees |
DM
2010
14 years 12 months ago
2010
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
WG
2009
Springer
15 years 6 months ago
2009
Springer
COCOC
1995
15 years 3 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
101
click to vote
JCO
2007
14 years 11 months ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...
104
click to vote
ICML
2004
IEEE
16 years 17 days ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...