Distributed CSPs by graph partitioning

DOI10.1016/j.amc.2006.05.090zbMath1107.68105OpenAlexW1992721217MaRDI QIDQ864803

Miguel A. Salido, Federico Barber

Publication date: 13 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.090

zbMATH Keywords

artificial intelligenceconstraint satisfaction problemsdistributed CSPs

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)

Related Items

A review of literature on parallel constraint solving ⋮ A non-binary constraint ordering heuristic for constraint satisfaction problems

Uses Software

• METIS
• ParMETIS

Cites Work

• Network-based heuristics for constraint-satisfaction problems
• A Sufficient Condition for Backtrack-Free Search
• An Efficient Heuristic Procedure for Partitioning Graphs
• Artificial Intelligence: Methodology, Systems, and Applications

This page was built for publication: Distributed CSPs by graph partitioning