Combining tree partitioning, precedence, and incomparability constraints
DOI10.1007/s10601-007-9040-xzbMath1162.05321OpenAlexW2045500667WikidataQ57574273 ScholiaQ57574273MaRDI QIDQ1020493
Pierre Flener, Xavier Lorca, Nicolas Beldiceanu
Publication date: 29 May 2009
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-007-9040-x
treefilteringglobal constraintHamiltonian path problemprecedence constraintdigraph partitioningincomparability constraintordered disjoint paths problemphylogenetic supertree problemtree constraint
Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Combining tree partitioning, precedence, and incomparability constraints
- Determining the consistency of partial tree descriptions
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- The complexity of reconstructing trees from qualitative characters and subtrees
- Hamiltonian circuits in random graphs
- Reconstruction of rooted trees from subtrees
- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
- Necessary Condition for Path Partitioning Constraints
- A fast algorithm for finding dominators in a flowgraph
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- The tree Constraint
- On Hamiltonian Circuits
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for publication: Combining tree partitioning, precedence, and incomparability constraints