The Minimum Spanning Tree Constraint
From MaRDI portal
Recommendations
- A constrained minimum spanning tree problem
- The minimum weight spanning tree with constraints
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Minimal spanning trees with a constraint on the number of leaves
- The constrained minimum spanning tree problem
- The minimum-area spanning tree problem
- Algorithms and Data Structures
- Minimum spanning trees
- On the weight-constrained minimum spanning tree problem
Cited in
(15)- Counting weighted spanning trees to solve constrained minimum spanning tree problems
- The weighted arborescence constraint
- Minimum spanning tree cycle intersection problem
- Weighted spanning tree constraint with explanations
- SAT modulo graphs: acyclicity
- Minimum spanning Markovian trees: Introducing context-sensitivity into the generation of spanning trees
- The minimum weight spanning tree with constraints
- The “Not-Too-Heavy Spanning Tree” Constraint
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- The Minimum Spanning Tree Problem with Time Window Constraints
- Improved filtering for weighted circuit constraints
- Solving the quorumcast routing problem by constraint programming
- 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
- Minimum cost spanning tree problems with groups
This page was built for publication: The Minimum Spanning Tree Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524240)