scientific article; zbMATH DE number 16725
From MaRDI portal
Publication:3973411
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)
Recommendations
Cited in
(14)- Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\)
- Tight integral duality gap in the Chinese postman problem
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
- On multicommodity flows in planar graphs
- On matchings, T‐joins, and arc routing in road networks
- On cuts and matchings in planar graphs
- Undirected distances and the postman-structure of graphs
- Planar Multicommodity Fows, Maximum Matchings and Negative Cycles
- An algorithm for min-cost edge-disjoint cycles and its applications
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- On dual integrality in matching problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973411)
