Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Ullmann:1985:CAS,
author = "Julian R. Ullmann and Robert M. Haralick and Linda G.
Shapiro",
title = "Computer Architecture for Solving Consistent Labelling
Problems",
journal = j-COMP-J,
volume = "28",
number = "2",
pages = "105--110",
month = may,
year = "1985",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/28.2.105",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:18 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/28/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/28/2/105.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/105.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/106.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/107.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/108.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/109.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/110.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/111.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Sheffield, Dep of Computer Science, Sheffield,
Engl",
affiliationaddress = "Univ of Sheffield, Dep of Computer Science,
Sheffield, Engl",
classcodes = "C4240 (Programming and algorithm theory); C4290 (Other
computer theory); C5220 (Computer architecture); C5440
(Multiprocessing systems)",
classification = "722; 723",
corpsource = "Dept. of Comput. Sci., Sheffield Univ., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algorithm theory; Algorithms; asynchronous; computer
architecture; computer programming; computer systems,
digital --- Parallel Processing; consistent labeling
problem; consistent labelling problems; constraint
propagation; constraint satisfaction problems; elapsed
time; graph coloring; hardware; intercommunicating
computers; isomorphism; multiprocessing; network;
NP-complete; NP-completeness; parallel processing;
parallel tree search; propositional theorem proving;
school timetabling; screen labelling; subgraph;
systems; tree search; trees (mathematics)",
treatment = "P Practical",
xxpages = "105--111",
}