Fast parallel constraint satisfaction

DOI10.1007/3-540-56939-1_91MaRDI QIDQ4630280zbMATH OpenOpenAlexFDO

Authors L. M. Kirousis

Publication date 29 March 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56939-1_91

zbMATH Keywords

bipartite graphconstraint satisfaction problemline drawingparallel algorithmtransitive closure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Fast parallel constraint satisfaction
• scientific article; zbMATH DE number 1234562
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Publication:3493326
• A tagging method for parallel constraint satisfaction

Cites work

• A fast parallel algorithm for the maximal independent set problem
• A generic arc-consistency algorithm and its specializations
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A sufficient condition for backtrack-bounded search
• A Sufficient Condition for Backtrack-Free Search
• A taxonomy of problems with fast parallel algorithms
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
• Arc consistency for factorable relations.
• Constraint relaxation may be perfect
• Constructing a Maximal Independent Set in Parallel
• From local to global consistency
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Parallel consistent labeling algorithms
• The complexity of recognizing polyhedral scenes

Cited in

(11)

• A tagging method for parallel constraint satisfaction
• Fast parallel constraint satisfaction
• Local consistency in parallel constraint satisfaction networks
• Fast and parallel decomposition of constraint satisfaction problems
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• scientific article; zbMATH DE number 4166938 (Why is no real title available?)
• Computer Architecture for Solving Consistent Labelling Problems
• scientific article; zbMATH DE number 2086856 (Why is no real title available?)
• Fast parallel heuristics for the job shop scheduling problem
• Constraint satisfaction -- algorithms and complexity analysis

This page was built for publication: Fast parallel constraint satisfaction

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