Uncrossing a family of set-pairs

DOI10.1007/S004930170009MaRDI QIDQ873653zbMATH OpenOpenAlexFDO

Authors Tamás Fleiner

Publication date 29 March 2007

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004930170009

zbMATH Keywords

set-pairs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Packing and covering of crossing families of cuts
• Coverings and structure of crossing families
• How to tidy up a symmetric set-system by use of uncrossing operations
• Approximating minimum-cost edge-covers of crossing biset-families
• Primal-dual approach for directed vertex connectivity augmentation and generalizations

Cited in

(8)

• An algorithm to increase the node-connectivity of a digraph by one
• Restricted \(t\)-matchings in bipartite graphs
• On uncrossing games for skew-supermodular functions
• A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
• Packing and covering of crossing families of cuts
• Approximating minimum-cost edge-covers of crossing biset-families
• Tree-compositions and orientations
• How to tidy up a symmetric set-system by use of uncrossing operations

This page was built for publication: Uncrossing a family of set-pairs

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