The line index and minimum cut of weighted graphs
type: Item
instance of: scholarly article
title: The line index and minimum cut of weighted graphs
zbMATH Open document ID: 0972.05026
DOI: 10.1016/S0377-2217(97)00196-3
published in: European Journal of Operational Research
publication date: 2001-11-13T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1338073
zbMATH Keywords: minimum cut
zbMATH Keywords: balanced graph
zbMATH Keywords: planar graph
zbMATH Keywords: series-parallel graph
zbMATH Keywords: line index
zbMATH Keywords: minimum capacity
zbMATH Keywords: weighted graphs
zbMATH Keywords: linear algorithms
author: Shaoji Xu
MaRDI profile type: Publication
cites work: Topology of series-parallel networks
cites work: The max-cut problem on graphs not contractible to \(K_ 5\)
cites work: Unifying maximum cut and minimum cut of a planar graph
cites work: Q4142699
cites work: Q4198056
cites work: Q5659589
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: Q4007392
cites work: Weakly bipartite graphs and the max-cut problem
cites work: Q4840774
cites work: On the notion of balance of a signed graph
cites work: A simple algorithm to detect balance in signed graphs
cites work: An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
cites work: Q3951566
cites work: Maximal Flow Through a Network
cites work: Q4091421
cites work: On some extremal problems in graph theory
cites work: Balancing signed graphs
cites work: Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”
cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
cites work: Some simplified NP-complete graph problems
cites work: A polynomial algorithm for the max-cut problem on graphs without long odd cycles
cites work: Parallel concepts in graph theory
description: scientific article; zbMATH DE number 1338073