Parallel consistent labeling algorithms

DOI10.1007/BF01407901zbMath0646.68104MaRDI QIDQ1104118

Tom Henderson, Ashok Samal

Publication date: 1987

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

zbMATH Keywords

parallel complexityconstraint satisfaction algorithmconsistent labelingcomputer vision algorithmsarc consistencyButterfly mircoprocessorinherent parallelismnode consistency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Theory of operating systems (68N25)

Related Items

Fast parallel constraint satisfaction, Local consistency in parallel constraint satisfaction networks, On the parallel complexity of discrete relaxation in constraint satisfaction networks, On the speed of constraint propagation and the time complexity of arc consistency testing, Bounds for the Quantifier Depth in Finite-Variable Logics, The \(Multi\)-SAT algorithm, Fast parallel constraint satisfaction

Cites Work

• Unnamed Item
• Reduction operations for constraint satisfaction
• Network-based heuristics for constraint-satisfaction problems
• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• Estimating the Efficiency of Backtrack Programs
• Scene Labeling by Relaxation Operations
• Time Bounded Random Access Machines with Parallel Processing