Parallel ear decomposition search (EDS) and st-numbering in graphs
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Multi-Tree Approach To Reliability In Distributed NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithmsPublished by Association for Computing Machinery (ACM) ,1986
- Parallel ear decomposition search (EDS) and st-numbering in graphsPublished by Springer Nature ,1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- A parallel algorithm for the maximal path problemPublished by Association for Computing Machinery (ACM) ,1985
- Computing ears and branchings in parallelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- An optimal parallel algorithm for integer sortingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parallel Algorithms in Graph Theory: Planarity TestingSIAM Journal on Computing, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Computing an st-numberingTheoretical Computer Science, 1976