Pages that link to "Item:Q3973411"
From MaRDI portal
The following pages link to Planar multicommodity flows, max cut, and the Chinese Postman Problem (Q3973411):
Displaying 13 items.
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) (Q830923) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- On dual integrality in matching problems (Q2314407) (← links)
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs (Q2813347) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- On multicommodity flows in planar graphs (Q3340473) (← links)
- On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
