Download:
|
by E. N. Caceres, S. W. Song, J. L. Szwarc Ter
http://www.ime.usp.br/~song/papers/pdpta01-1.ps
Add To MetaCart
Abstract:
Instituto de Matematica and Nucleo de Computac~ao Eletr^onica
Citations
|
63
|
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
– Caceres, Dehne, et al.
- 1997
|
|
45
|
A combinatorial decomposition theory
– Cunningham, Edmonds
- 1980
|
|
29
|
and Vijaya Ramachandran. Parallel algorithms for shared-memory machines
– Karp
- 1990
|
|
26
|
Reducing prime graphs and recognizing circle graphs
– Bouchet
- 1987
|
|
23
|
Recognizing circle graphs in polynomial time
– Gabor, Hsu, et al.
- 1989
|
|
17
|
Coarse grained parallel algorithms
– Dehne
- 1999
|
|
10
|
Parallelism and greedy algorithms
– Anderson, Mayr
- 1984
|
|
9
|
A Parallel Algorithm for the Maximal Path Problem
– Anderson
- 1987
|
|
7
|
Valiant A Bridging Model for Parallel Computation
– G
- 1990
|
|
3
|
Valiant: The complexity of enumeration and reliability problems
– G
- 1979
|
|
2
|
Cunningham.: Decomposition of Directed Graphs
– H
- 1982
|
|
1
|
Parallel Algorithms for Graph Problems
– Caceres
- 1992
|
|
1
|
Graphes des Cordes, Caracterisation et Reconnaissance
– Naji
- 1985
|
|
1
|
Enumerating the Maximal Cliques of Circle Graph
– Szwarc, Barroso
- 1991
|
|
1
|
A Coarse-Grained Parallel Algorithm for
– Caceres, Song, et al.
|
