The line index and minimum cut of weighted graphs

European Journal of Operational Research

Volumn 109, Issue 3, 1998, Pages 672-685

  Xu, Shaoji ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Balanced graph; Line index; Minimum cut; Planar graph; Series parallel graph; Weighted graph

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS;

SERIES PARALLEL GRAPHS; WEIGHTED GRAPHS;

GRAPH THEORY;

EID: 0347659166     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00196-3     Document Type: Article

References (23)

1. R.J. Duffin, Topology of series-parallel networks, J. Math. Analysis Appl. 10 (1965) 303-318.
2. 5, Oper. Res. Letters 2 (1983) 107-111.
3. W.K. Shih, S. Wu, Y.S. Kuo, Unifying maximum cut and minimum cut of a planar graph, IEEE Trans. Comput. 39 (1990) 694-697.
4. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972.
5. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
6. G.I. Orlova, Y.G. Dorfman, Finding the maximum cut in a graph, Engrg. Cybernetics 10 (1972) 502-504.
7. F.O. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput. 4 (1975) 221-225.
8. A.P. Terebenkov, NP-completeness of maximum-cut and cycle-covering problems for a planar graph, Cybernetics 27 (1991) 16-20.
9. M. Grötschel, W.R. Pulleyblank, Weakly bipartite graphs and the max-cut problem, Oper. Res. Letters 1 (1981) 23-27.
10. S. Poljak, Z. Tuza, Maximum cuts and large bipartite subgraphs, Combinatorial Optimization, DIMACS ser. in Discrete Mathematics and Theoretical Computer Science 20 (1995) 181-244.
11. F. Harary, On the notion of balance of a signed graph, Michigan Math. J. 2 (1954) 143-146.
12. F. Harary, J.A. Kabell, A simple algorithm to detect balance in signed graphs, Mathematical Social Sciences 1 (1980) 131-136.
13. J.S. Maybee, S.J. Maybee, An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs, Mathematical Social Sciences 6 (1983) 99-103.
14. A.M. Farley, A. Proskurowski, Computing the line index of balance of signed outer-planar graphs, Congressus Numerantium 32 (1981) 323-332.
15. C. Ford, D. Fulkerson, Maximal flow through a network, Canad. J. Math. 8 (1956) 399-404.
16. A. Aho, J. Hopcroft, J. Ullman, The Design and Analysis of Computer Alogrithms, Addison-Wesley, Reading, MA, 1974.
17. P. Erdös, On some extremal problems in graph theory, Isarel J. Math. 3 (1965) 113-116.
18. J. Akiyama, D. Avis, V. Chvátal, H. Era, Balancing signed graphs, Discr. Appl. Math. 3 (1981) 227-233.
19. K. Aoshima, M. Iri, Comments on F. Hadlock's paper: Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput. 6 (1977) 86-87.
20. E. Boros, P.L. Hammer, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Annals of Operations Research 33 (1991) 151-180.
21. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. 1 (1976) 237-267.
22. M. Grötschel, G.L. Nemhauser, A polynomial algorithm for the max-cut problem of graphs without long odd cycles, Report No. 8221-OR, Universität Bonn, 1982.
23. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.