Uncrossing a family of set-pairs

DOI10.1007/s004930170009zbMath1107.05306OpenAlexW2078162469MaRDI QIDQ873653

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)

Related Items (4)

A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs ⋮ Restricted \(t\)-matchings in bipartite graphs ⋮ Tree-compositions and orientations ⋮ An algorithm to increase the node-connectivity of a digraph by one

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