Packing and covering of crossing families of cuts

DOI10.1016/0095-8956(83)90066-7zbMATH Open0533.05039OpenAlexW1992939576MaRDI QIDQ789399FDOQ789399

Authors: Alexander Schrijver 

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/10050

Recommendations

• scientific article; zbMATH DE number 3910407
• Families of cuts with the MFMC-property
• Coverings and structure of crossing families
• Uncrossing a family of set-pairs
• scientific article; zbMATH DE number 3862931

zbMATH Keywords

minimum lengthcoveringmax-flow min-cut propertycrossing family of subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A counterexample to a conjecture of Edmonds and Giles
• A Minimax Theorem for Directed Graphs
• On two minimax theorems in graph
• The matroids with the max-flow min-cut property
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Title not available (Why is that?)
• Directed cut transversal packing for source-sink connected graphs
• Title not available (Why is that?)
• Min-max Relations for Directed Graphs
• Title not available (Why is that?)
• Proving total dual integrality with cross-free families—A general framework
• Packing rooted directed cuts in a weighted directed graph
• Some remarks on good colorations
• Title not available (Why is that?)

Cited In (4)

• Approximating minimum-cost edge-covers of crossing biset-families
• Uncrossing a family of set-pairs
• Generalized polymatroids and submodular flows
• Families of cuts with the MFMC-property

This page was built for publication: Packing and covering of crossing families of cuts

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