Entry Ullmann:1985:CAS from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@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",
}
Related entries
- architecture,
23(2)115,
23(4)382,
24(1)25,
24(1)62,
24(2)139,
24(3)210,
24(4)353,
25(1)74,
25(1)153,
25(2)207,
26(1)43,
26(3)208,
27(2)127,
27(3)254,
27(4)294,
27(4)362,
28(2)138,
28(2)170,
28(3)282,
29(2)103,
29(2)182,
29(4)300,
29(5)416,
29(5)451,
29(6)486,
30(2)110,
30(2)157,
30(2)189,
30(3)214,
30(4)289,
30(5)404,
30(5)413,
32(1)29,
32(2)175,
32(3)267,
32(3)281,
32(4)370,
32(5)453,
32(5)461,
32(6)505
- asynchronous,
32(4)362
- coloring,
28(1)78,
31(1)76
- complete;, NP-,
30(5)458
- consistent,
27(2)121
- constraint,
24(2)118,
26(2)124,
27(3)209,
28(1)82,
28(3)298,
28(4)398,
29(5)416,
31(2)125,
31(4)336,
32(4)362
- graph,
23(3)237,
24(1)85,
25(3)338,
25(3)397,
27(1)86,
27(2)165,
28(1)5,
28(1)44,
28(1)78,
29(6)531,
29(6)553,
30(1)16,
30(1)20,
30(2)128,
30(6)498,
31(1)71,
31(1)76,
31(2)155,
31(3)253,
31(4)289,
31(4)304,
31(6)545,
32(1)45,
32(2)175,
32(4)290,
32(5)461,
32(5)474
- hardware,
23(1)46,
23(2)115,
24(3)230,
24(4)353,
25(4)471,
27(2)143,
27(3)246,
27(3)254,
28(3)200,
28(3)264,
28(4)357,
30(4)295,
31(3)193,
32(2)152,
32(4)362
- labeling,
28(1)5
- labelling,
28(1)5,
30(2)176
- mathematics,
23(2)161,
23(3)248,
23(3)256,
23(4)332,
25(1)158,
25(2)235,
25(2)239,
25(2)257,
26(2)97,
26(2)106,
26(2)188,
26(3)193,
26(3)205,
26(3)224,
27(2)178,
27(2)184,
27(3)218,
27(3)225,
27(4)368-1,
28(1)73,
28(3)313,
28(4)417,
28(4)426,
28(4)433,
28(4)439,
28(5)538,
29(1)36,
29(1)52,
29(1)76,
29(2)171,
29(2)176,
29(6)564,
30(3)268,
30(3)277,
30(3)282,
30(4)355,
30(5)433,
30(6)569,
31(1)61,
31(1)65,
31(3)269,
31(4)330,
31(4)353,
31(4)364,
31(6)557,
31(6)564,
31(6)567,
32(1)68,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- multiprocessing,
24(4)353,
25(1)22,
28(2)142,
28(5)449,
28(5)466,
29(1)1,
29(2)109,
29(2)118,
29(2)182,
29(5)390,
29(5)404,
30(3)214,
31(3)201,
32(1)29,
32(2)162,
32(3)267,
32(4)362
- NP-complete,
28(4)406,
30(5)458,
32(5)474
- NP-completeness,
27(4)315
- propagation,
25(1)22,
28(3)250,
28(5)466,
32(4)362
- propositional,
31(6)510
- proving,
27(3)230,
28(5)474,
31(1)51,
31(6)510,
32(5)437
- satisfaction,
31(5)409
- screen,
27(2)112,
28(2)117,
31(5)457
- search,
23(3)248,
23(3)256,
24(1)29,
25(1)2,
25(1)126,
25(1)158,
25(2)199,
25(3)353,
26(2)106,
26(2)154,
27(4)373,
28(2)179,
28(3)264,
28(3)313,
28(3)319,
29(1)17,
29(1)36,
29(1)52,
29(1)76,
29(2)167,
29(2)176,
29(4)368,
29(5)436,
30(6)565,
31(2)175,
32(1)68,
32(3)212,
32(6)567,
z(z)z
- solving,
23(3)274,
24(1)29,
24(1)87,
24(4)353,
24(4)384-2,
25(2)264,
26(4)383,
28(4)353,
30(2)189,
31(6)557,
32(1)13,
32(6)541
- theorem,
27(1)8,
27(3)230,
28(5)474,
29(3)277,
31(1)17,
31(1)51,
31(6)510,
32(5)437
- time,
23(1)34,
23(2)147,
23(2)153,
23(3)262,
23(4)290,
24(1)85,
24(2)156,
25(1)32,
25(1)45,
25(2)193,
25(4)429,
26(2)154,
26(3)224,
26(4)293,
26(4)320,
27(1)27,
27(3)201,
27(3)246,
27(3)254,
27(4)368-1,
28(1)9,
28(1)54,
28(1)78,
28(3)309,
28(4)409,
28(4)412,
29(1)47,
29(1)52,
29(2)103,
29(2)118,
29(2)176,
29(3)229,
29(3)269,
29(5)390,
29(5)396,
29(5)436,
30(3)249,
30(4)362,
30(4)372,
30(4)376,
30(5)475,
30(6)519,
30(6)535,
31(3)243,
31(3)279,
31(3)283,
31(6)496,
31(6)545,
31(6)553,
32(3)212,
32(3)228,
32(3)241,
32(4)374,
32(5)474