76 search results - page 4 / 16 » Judicious partitions of directed graphs |
112
Voted
IJDSN
2008
15 years 7 days 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...
126
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
79
Voted
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
105
Voted
JPDC
2007
15 years 18 days ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
93
Voted
SODA
1997
ACM
15 years 2 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...