The tree Constraint
From MaRDI portal
Recommendations
Cited in
(17)- Combining tree partitioning, precedence, and incomparability constraints
- Counting weighted spanning trees to solve constrained minimum spanning tree problems
- The weighted arborescence constraint
- Explaining circuit propagation
- On computing the 2-vertex-connected components of directed graphs
- Uncovering trees in constraint networks
- Strong articulation points and strong bridges in large scale graphs
- Global constraints for tree partitions of graphs
- scientific article; zbMATH DE number 67813 (Why is no real title available?)
- Finite and Rational Tree Constraints
- Finding strong bridges and strong articulation points in linear time
- Improved filtering for weighted circuit constraints
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Undirected forest constraints
- Global constraint catalogue: past, present and future
This page was built for publication: The tree Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450922)