Necessary Condition for Path Partitioning Constraints

DOI10.1007/978-3-540-72397-4_11MaRDI QIDQ3612414zbMATH OpenOpenAlexFDO

Authors Nicolas Beldiceanu, Xavier Lorca

Publication date 10 March 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72397-4_11

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Disjoint Paths in a Planar Graph—A General Theorem
• Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
• Partitioning a graph into vertex-disjoint paths
• Finding \(k\) partially disjoint paths in a directed planar graph
• Partitioning a bipartite graph into vertex-disjoint paths.

Cited in

(2)

• Combining tree partitioning, precedence, and incomparability constraints
• scientific article; zbMATH DE number 7313927 (Why is no real title available?)

This page was built for publication: Necessary Condition for Path Partitioning Constraints

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