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

DOI10.1137/0405038zbMath0774.05056OpenAlexW2088173714MaRDI QIDQ4030186

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

zbMATH Keywords

polyhedrareachabilitydirected graphblocking cluttersequivalent subgraphseries-parallel directed graphs

Mathematics Subject Classification ID

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

Related Items

Arborescence polytopes for series-parallel graphs, On the directed cut cone and polytope, Using a hybrid of exact and genetic algorithms to design survivable networks