Efficient parallel triconnectivity in logarithmic time
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A new graphy triconnectivity algorithm and its parallelizationPublished by Association for Computing Machinery (ACM) ,1987
- Parallel ear decomposition search (EDS) and st-numbering in graphsTheoretical Computer Science, 1986
- Approximate and exact parallel scheduling with applications to list, tree and graph problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Finding Euler tours in parallelJournal of Computer and System Sciences, 1984
- Gauss codes, planar hamiltonian graphs, and stack-sortable permutationsJournal of Algorithms, 1984
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Computing connected components on parallel computersCommunications of the ACM, 1979
- A forbidden substructure characterization of Gauss codesBulletin of the American Mathematical Society, 1976
- QUEUES, STACKS AND GRAPHSPublished by Elsevier ,1971
- Non-Separable and Planar GraphsTransactions of the American Mathematical Society, 1932