The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs
Copyright policy )The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs
An equivalent subgraph of a directed graph \(G\) has the same reachability between vertices as \(G\). The families of minimal equivalent subgraphs and minimal directed cuts of a graph \(G\) form a pair of blocking clutters. The author shows that the minimal equivalent subgraph [directed cut] inequalities completely describe the directed cut [equivalent subgraph] polyhedron on strongly connected series-parallel directed graphs.
blocking clutters, Connectivity, Combinatorial optimization, Directed graphs (digraphs), tournaments, equivalent subgraph, polyhedra, directed graph, series-parallel directed graphs, reachability
blocking clutters, Connectivity, Combinatorial optimization, Directed graphs (digraphs), tournaments, equivalent subgraph, polyhedra, directed graph, series-parallel directed graphs, reachability
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!