The st-bond polytope on series-parallel graphs
From MaRDI portal
Publication:4611490
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Circuit and bond polytopes on series-parallel graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Lexicographical polytopes
- Maximal Flow Through a Network
- On the cut polytope
- On the dimension of projected polyhedra
- On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency
- Parallel recognition of series-parallel graphs
- The Concavity and Intersection Properties for Integral Polyhedra
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Topology of series-parallel networks
- When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks
Cited in
(4)
This page was built for publication: The \(st\)-bond polytope on series-parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611490)