Efficient computation of implicit representations of sparse graphs

Discrete Applied Mathematics

Volumn 78, Issue 1-3, 1997, Pages 1-16

  Arikati, Srinivasa R ^a   Maheshwari, Anil ^b   Zaroliagis, Christos D ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Arboricity; Graph algorithms; Implicit representation; Parallel computation; Sparse graphs

Indexed keywords

EID: 0003104448     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00007-3     Document Type: Article

References (21)

1. J. Edmonds, Minimum partition of a matroid into independent sets, Res. NBS 69B (1965) 67-72.
2. R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Inform. and Control 70 (1986) 32-53.
3. R. Cole and U. Vishkin, Faster optimal prefix sums and list ranking, Inform. and Comput. 81 (1989) 334-352.
4. M. Fürer, X. He, M. Kao and B. Raghavachari, Parallel algorithms for straight-line grid embeddings of planar graphs, Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA'92) (1992) 410-419.
5. H.N. Gabow and H.H. Westermann, Forests, frames, and games: algorithms for matroid sums and applications, Algorithmica 7 (1992) 465-497.
6. A. Goldberg, S. Plotkin and G. Shannon, Parallel symmetry-breaking in sparse graphs, SIAM J. Discrete Math. 1 (1988) 434-446.
7. T. Hagerup, Optimal parallel algorithms on planar graphs, Inform. Comput. 84 (1990) 71-96.
8. T. Hagerup, M. Chrobak and K. Diks, Optimal parallel 5-colouring of planar graphs, SIAM J. Comput. 18 (1989) 288-300.
9. M. In and S. Fujishige, Use of matroid theory in operating research, circuits and systems theory, Int. J. Systems Sci. 12 (1981) 27-54.
10. A. Itai and M. Rodeh, The multi-tree approach to reliability in distributed networks, Proceedings of the 25th IEEE Symposium on FOCS (1984) 137-147.
11. J. JáJá, An Introduction to Parallel Algorithms, (Addison-Wesley, New York, 1992).
12. S. Kannan, M. Naor, and S. Rudich, Implicit representation of graphs, Proceedings of the 20th ACM Symposium on Theory of Computing (STOC'88) (1988) 334-343.
13. L. Lovasz and Y. Yemini, On generic rigidity in the plane, SIAM J. Algebr. Discrete Methods 3 (1982) 91-98.
14. H. Nagamochi and T. Ibaraki, Computing edge-connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Math. 5 (1992) 54-68.
15. H. Narayanan, H. Saran and V.V. Vazirani, Randomized parallel algorithms for matroid union and intersection, with applications to arborescences, and edge-disjoint spanning trees, Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (SODA'92) (1992) 357-366.
16. C.St. J.A. Nash-Williams, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961) 445-450.
17. C.St. J.A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964) 12.
18. T. Ohtsuki, Y. Ishizaki and H. Watanabe, Topological degrees of freedom and mixed analysis of electrical networks, IEEE Trans. Circuit Theory CT-17 (1970) 491-499.
19. W. Schayder, Embedding planar graphs on the grid, Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA'90) (1990) 138-148.
20. A. Subramanian, Two recent algorithms for the global minimum cut problem, SIGACT News 26 (1995) 78-87.
21. J. van Leeuwen, Graph algorithms, in: J. van Leeuwen, Ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam, 1990) 525-631.