The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs

DOI10.1137/0405038zbMATH Open0774.05056OpenAlexW2088173714MaRDI QIDQ4030186FDOQ4030186

Authors: Sunil Chopra 

Publication date: 1 April 1993

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405038

Recommendations

• Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
• A family of perfect graphs associated with directed graphs
• An efficiently solvable case of the minimum weight equivalent subgraph problem
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• On the directed cut cone and polytope

zbMATH Keywords

polyhedrareachabilitydirected graphblocking cluttersequivalent subgraphseries-parallel directed graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial optimization (90C27) Connectivity (05C40)

Cited In (6)

• \(k\)-edge connected polyhedra on series-parallel graphs
• An efficiently solvable case of the minimum weight equivalent subgraph problem
• On the directed cut cone and polytope
• Arborescence polytopes for series-parallel graphs
• Using a hybrid of exact and genetic algorithms to design survivable networks
• Series-parallel subgraphs of planar graphs

This page was built for publication: The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030186)