Edge Connectivity between Nodes and Node-Subsets

Networks

Volumn 31, Issue 3, 1998, Pages 157-163

  Ito, Hiro ^a   Yokoyama, Mitsuo ^a  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141779511     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199805)31:3<157::AID-NET2>3.0.CO;2-E     Document Type: Article

References (17)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974).
2. C. Berge, Graphs and Hypergraphs. North-Holland, Amsterdam (1976).
3. S. Even and R. E. Tarjan, Network flow and testing graph connectivity. SIAM J. Comput. 4(4) (1975) 507-518.
4. H. N. Gabow, A matroid approach to finding edge connectivity and packing arborescences. Proceedings of the 23rd ACM Symposium Theory of Computing (1991) 112-122.
5. G. Y. Handler and P. B. Mirchandani, Location on Networks: Theory and Algorithms, MIT Press, Cambridge (1979).
6. F. Harary, Graph Theory, Addison-Wesley, Reading, MA (1969).
7. J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components. Info. Comput. 79 (1988) 43-59.
8. H. Ito, Node-to-area connectivity of graphs. Proceedings of APORS'94 (M. Fushimi and K. Tone, Eds.). World Scientific, Singapore (1995) 89-96.
9. H. Ito, Connectivity problem on area graphs for locally striking disasters - direct NA-connection. Trans. Inst. Electron. Inform. Comn. Eng. Jpn. (Special Section of Selected Papers from the 7th Karuizawa Workshop on Circuits and Systems) E78-A(3) (1995) 363-370.
10. H. Ito, Telecommunication network simplifying problem-connectivity, area graph and T-mixed cut. NTT R&D 44(4) (1995) 367-372 (in Japanese).
11. M. Labbe, D. Peeters, and J.-F. Thisse, Location on networks. Handbooks in OR & MS (M. O. Ball et al., Eds.). 8 (1995) 551-624.
12. H. Nagamochi and T. Ibaraki, A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7 (1992) 583-596.
13. H. Nagamochi and T. Ibaraki, A linear time algorithm for computing 3-edge-connected components in a multigraph, Jpn. J. Ind. Appl. Math. 9(2) (1992) 163-180.
14. H. Nagamochi and T. Watanabe, Computing k-edge-connected components in multigraphs. Trans. Inst. Electron. Inform. Comm. Eng. Jpn. E76-A(4) (1993) 513-517.
15. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, Location problems on undirected flow networks. Trans. Inst. Electron. Inform. Comm. Eng. Jpn. E73(12) (1990) 1989-1993.
16. B. C. Tansel, R. L. Francis, and T. J. Lowe, Location on networks: A survey. Part I and Part II. Mgmt. Sci. 29(4) (1983) 482-511.
17. S. Taoka, T. Watanabe, and K. Onaga, A linear-time algorithm for computing all 3-edge-connected components of a multigraph. Trans. Inst. Electron. Inform. Comm. Eng. Jpn. E75-A(3) (1992) 410-424.