823 search results - page 81 / 165 » Brick partitions of graphs |
143
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
199
click to vote
MLMTA
2007
15 years 7 months ago
2007
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
179
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
200
click to vote
IPPS
2007
IEEE
16 years 14 days ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
156
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...