The Minimum Spanning Tree Constraint

DOI10.1007/11889205_13zbMath1160.68544OpenAlexW1867111234MaRDI QIDQ3524240

Grégoire Dooms, Irit Katriel

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889205_13

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ SAT Modulo Graphs: Acyclicity ⋮ Improved filtering for weighted circuit constraints ⋮ Solving the quorumcast routing problem by constraint programming ⋮ Counting weighted spanning trees to solve constrained minimum spanning tree problems ⋮ The weighted arborescence constraint

This page was built for publication: The Minimum Spanning Tree Constraint