Counting weighted spanning trees to solve constrained minimum spanning tree problems

DOI10.1007/978-3-319-59776-8_14zbMath1489.68188OpenAlexW2617647927MaRDI QIDQ2011588

Gilles Pesant, Antoine Delaite

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_14

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Achieving Domain Consistency and Counting Solutions for Dispersion Constraints
• Weighted Spanning Tree Constraint with Explanations
• Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
• Solution Counting Algorithms for Constraint-Centered Search Heuristics
• The Minimum Spanning Tree Constraint
• The Weighted Spanning Tree Constraint Revisited
• The “Not-Too-Heavy Spanning Tree” Constraint
• Counting Minimum Weight Spanning Trees
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• The tree Constraint

This page was built for publication: Counting weighted spanning trees to solve constrained minimum spanning tree problems