ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION

DOI10.15807/JORSJ.41.626zbMath1003.05096OpenAlexW2103489475MaRDI QIDQ4538126

Satoru Fujishige

Publication date: 11 July 2002

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7320f13b5889bf3b7976f10955aa39b81b678fa4

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Graph connectivity and its augmentation: Applications of MA orderings

This page was built for publication: ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION