Planar orientations with low out-degree and compaction of adjacency matrices
- 1 September 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 86 (2) , 243-266
- https://doi.org/10.1016/0304-3975(91)90020-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Parallel recognition and decomposition of two terminal series parallel graphsInformation and Computation, 1987
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- An Approximation Algorithm for the Maximum Independent Set Problem on Planar GraphsSIAM Journal on Computing, 1982
- The clique problem for planar graphsInformation Processing Letters, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- Finding a Minimum Circuit in a GraphSIAM Journal on Computing, 1978
- Efficient Planarity TestingJournal of the ACM, 1974
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite GraphsCanadian Journal of Mathematics, 1960