178 search results - page 11 / 36 » Constructing the Spanners of Graphs in Parallel |
150
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 4 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
125
click to vote
HPCC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
132
click to vote
PPSC
1997
15 years 5 months ago
1997
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latenc...
130
click to vote
ICALP
1995
Springer
15 years 7 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
110
click to vote
EOR
2006
15 years 4 months ago
2006
: Aimed at detection of parallel assembly modes, a method for assembly graph construction is described that is based on the systematic generation and analysis of precedence relatio...