scientific article
From MaRDI portal
Publication:4007392
zbMath0800.68482MaRDI QIDQ4007392
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) ⋮ A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs ⋮ The line index and minimum cut of weighted graphs
This page was built for publication:
