Efficient Parallel Modular Decomposition (Extended Abstract)

Authors:
Elias Dahlhaus
Affiliations:
-
Venue:
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1995

Citing 0
Cited 2

Efficient and practical modular decomposition

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An optimal parallel solution for the path cover problem on P4-sparse graphs

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract