Counting weighted spanning trees to solve constrained minimum spanning tree problems

DOI10.1007/978-3-319-59776-8_14MaRDI QIDQ2011588zbMATH OpenOpenAlexFDO

Authors Antoine Delaite, Gilles Pesant

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)

Recommendations

• Counting Minimum Weight Spanning Trees
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• Weighted spanning tree constraint with explanations
• The minimum weight spanning tree with constraints
• The Weighted Spanning Tree Constraint Revisited

Cites work

• Achieving domain consistency and counting solutions for dispersion constraints
• Counting Minimum Weight Spanning Trees
• Counting-based search: branching heuristics for constraint satisfaction problems
• scientific article; zbMATH DE number 91018 (Why is no real title available?)
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• Solution Counting Algorithms for Constraint-Centered Search Heuristics
• The Minimum Spanning Tree Constraint
• The tree Constraint
• The Weighted Spanning Tree Constraint Revisited
• The “Not-Too-Heavy Spanning Tree” Constraint
• Weighted spanning tree constraint with explanations

Cited in

(3)

• The Weighted Spanning Tree Constraint Revisited
• Counting Minimum Weight Spanning Trees
• Minimum weight clustered dominating tree problem

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

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