scientific article
From MaRDI portal
Publication:3973411
zbMath0747.05067MaRDI QIDQ3973411
Publication date: 26 June 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) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)
Related Items (11)
Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) ⋮ Undirected distances and the postman-structure of graphs ⋮ Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem ⋮ On matchings, T‐joins, and arc routing in road networks ⋮ Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs ⋮ An algorithm for min-cost edge-disjoint cycles and its applications ⋮ On cuts and matchings in planar graphs ⋮ Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem ⋮ Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs ⋮ On dual integrality in matching problems
This page was built for publication:
