Parallel consistent labeling algorithms
From MaRDI portal
Cites work
- Consistency in networks of relations
- Estimating the Efficiency of Backtrack Programs
- scientific article; zbMATH DE number 3905859 (Why is no real title available?)
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- Reduction operations for constraint satisfaction
- Scene Labeling by Relaxation Operations
- Time Bounded Random Access Machines with Parallel Processing
Cited in
(7)- Fast parallel constraint satisfaction
- Local consistency in parallel constraint satisfaction networks
- The Multi-SAT algorithm
- On the speed of constraint propagation and the time complexity of arc consistency testing
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- Bounds for the quantifier depth in finite-variable logics: alternation hierarchy
- Fast parallel constraint satisfaction
This page was built for publication: Parallel consistent labeling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104118)