Min-max Relations for Directed Graphs
From MaRDI portal
Publication:3960724
DOI10.1016/S0304-0208(08)72456-3zbMath0497.05029MaRDI QIDQ3960724
Publication date: 1982
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Related Items
An efficient scaling algorithm for the minimum weight bibranching problem, Packing and covering of crossing families of cuts, A family of perfect graphs associated with directed graphs, Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers, Directed cut transversal packing for source-sink connected graphs, A Las Vegas RNC algorithm for maximum matching, An efficient algorithm for minimum-weight bibranching, On packing connectors, Efficient many-to-Many point matching in one dimension, Proving total dual integrality with cross-free families—A general framework, Vertex-disjoint paths and edge-disjoint branchings in directed graphs