Computer Architecture for Solving Consistent Labelling Problems

DOI10.1093/COMJNL/28.2.105zbMATH Open0567.68028OpenAlexW2052962175MaRDI QIDQ3683535FDOQ3683535

Authors: Julian R. Ullmann, Robert Haralick, Linda G. Shapiro 

Publication date: 1985

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/28.2.105

Recommendations

• Fast parallel constraint satisfaction
• Fast parallel constraint satisfaction
• scientific article; zbMATH DE number 1008453
• scientific article; zbMATH DE number 1759551
• On the parallel complexity of discrete relaxation in constraint satisfaction networks

zbMATH Keywords

hardwareparallel computationschool timetablingtree searchasynchronous network of intercommunicating computersNP-complete constraint satisfaction problems

Mathematics Subject Classification ID

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

Cited In (1)

• Partition search for non-binary constraint satisfaction

This page was built for publication: Computer Architecture for Solving Consistent Labelling Problems

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