92 search results - page 2 / 19 » Application of Fusion-Fission to the Multi-way Graph Partiti... |
189
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
159
Voted
GD
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
192
click to vote
EUROPAR
1999
Springer
15 years 11 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...
206
click to vote
IJDSN
2008
15 years 7 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
193
click to vote
WG
2004
Springer
16 years 22 days ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...