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