Decomposition of a bidirected graph into strongly connected components and its signed poset structure

Discrete Applied Mathematics

Volumn 68, Issue 3, 1996, Pages 237-248

  Ando, Kazutoshi ^a   Fujishige, Satoru ^a   Nemoto, Toshio ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041439269     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00068-3     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. K. Ando and S. Fujishige, (square cup,(square cap)-closed families and signed posets, Report No. 93813, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (January 1994).
3. K. Ando and S. Fujishige, On the structures of bisubmodular polyhedra, Report No. 94821, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (April 1994).
4. K. Ando, S. Fujishige and T. Naitoh, Proper bisubmodular systems and bidirected flows, Discussion Paper No. 532, Institute of Socio-Economic Planning, University of Tsukuba (April 1993).
5. N. Biggs, Algebraic Graph Theory (Cambridge University Press, London, 1974).
6. A. Bouchet and W.H. Cunningham, Delta-matroids, jump systems and bisubmodular polyhedra, SIAM J. Discrete Math. 8 (1995) 17-32.
7. R. Chandrasekaran and S.N. Kabadi, Pseudomatroids, Discrete Math. 71 (1988) 205-217.
8. A.L. Dulmage and N.S. Mendelsohn, A structure theory of bipartite graphs of finite exterior dimension, Trans. Roy. Soc. Canada, Third Series, Section III, 53 (1959) 1-13.
9. J. Edmonds and E.L. Johnson, Matching: a well-solved class of linear programs. In: R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds., Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1970) 88-92.
10. S. Fujishige, Principal structures of submodular systems, Discrete Appl. Math. 2 (1980) 77-79.
11. S. Fujishige, Submodular Functions and Optimization (North-Holland, Amsterdam, 1991).
12. M. Iri and S. Fujishige, Use of matroid theory in operations research, circuits and system theory, Int. J. Systems Sci. 12 (1981) 27-54.
13. M. Iri, S. Fujishige and T. Oyama, Graphs, Networks and Matroids (Sangyo-Tosho, Tokyo. 1986) (in Japanese).
14. V. Reiner, Signed posets, J. Combin. Theory, Ser. A 62 (1993) 324-360.
15. R.E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput. 1 (1972) 146-160.
16. T. Zaslavsky, Signed graphs. Discrete Appl. Math 4 (1982) 47-74. Erratum, 5 (1983) 248.
17. T. Zaslavsky, Orientation of signed graphs, Eur. J. Combin. 12 (1991) 361-375.