Upper degree-constrained partial orientations

DOI10.1145/1109557.1109618MaRDI QIDQ3581581zbMATH OpenOpenAlexFDO

Authors Harold N. Gabow

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109618

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Cited in

(6)

• Degree-constrained graph orientation: maximum satisfaction and minimum violation
• Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
• Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
• Finding degree-constrained acyclic orientations
• Upper and lower degree-constrained graph orientation with minimum penalty
• Degree-constrained orientations of embedded graphs

This page was built for publication: Upper degree-constrained partial orientations

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