Some improved parallelisms for graphs
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 379-385
- https://doi.org/10.1007/bfb0016262
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Parallel algorithms for connected components in a graphPublished by Springer Nature ,2005
- A note on finding minimum cuts in directed planar networks by parallel computationsInformation Processing Letters, 1985
- Finding biconnected componemts and computing tree functions in logarithmic parallel timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Parallel Algorithms in Graph Theory: Planarity TestingSIAM Journal on Computing, 1982
- Parallel computation and conflicts in memory accessInformation Processing Letters, 1982
- A structural characterization of planar combinatorial graphsDuke Mathematical Journal, 1937
- A combinatorial condition for planar graphsFundamenta Mathematicae, 1937