Fast parallel constraint satisfaction

DOI10.1007/3-540-56939-1_91zbMATH Open1422.68122OpenAlexW1512419275MaRDI QIDQ4630280FDOQ4630280

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

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

zbMATH Keywords

parallel algorithmbipartite graphtransitive closureconstraint satisfaction problemline drawing

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)

Cites Work

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

Cited In (11)

• Title not available (Why is that?)
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
• Local consistency in parallel constraint satisfaction networks
• Computer Architecture for Solving Consistent Labelling Problems
• A tagging method for parallel constraint satisfaction
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Fast parallel constraint satisfaction
• Fast parallel heuristics for the job shop scheduling problem
• Title not available (Why is that?)
• Fast and parallel decomposition of constraint satisfaction problems
• 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)