Entry Dutton:1981:NGC 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{Dutton:1981:NGC,
author = "R. D. Dutton and R. C. Brigham",
title = "A New Graph Colouring Algorithm",
journal = j-COMP-J,
volume = "24",
number = "1",
pages = "85--86",
month = feb,
year = "1981",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/24.1.85",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68C05 (05-04 05C15 68E10)",
MRnumber = "82b:68025",
bibdate = "Tue Dec 4 14:48:09 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/24/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/24/1/85.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/85.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/86.tif",
acknowledgement = ack-nhfb,
classcodes = "C1160 (Combinatorial mathematics)",
classification = "723",
corpsource = "Dept. of Computer Sci., Univ. of Central Florida,
Orlando, FL, USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algorithm; computer programming; graph colouring;
heuristic polynomial time; multiple edge; no loop
edge",
treatment = "A Application; T Theoretical or Mathematical",
}
Related entries
- 05-04,
28(1)78
- 05C15,
28(1)78,
31(1)76,
32(5)474
- 68C05,
23(1)37,
23(1)61,
23(1)73,
23(4)332,
24(2)148,
25(2)257,
25(4)423,
26(2)97
- 68E10,
23(2)161,
23(3)248,
23(4)332,
24(2)148,
25(3)338
- colouring,
25(3)338,
27(2)165,
28(1)78,
31(1)76,
32(5)474
- graph,
23(3)237,
25(3)338,
25(3)397,
27(1)86,
27(2)165,
28(1)5,
28(1)44,
28(1)78,
28(2)105,
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
- heuristic,
23(4)338,
25(3)353,
27(4)301,
27(4)315,
29(1)47,
29(2)135,
30(5)458,
31(3)253,
32(2)98,
32(3)228
- loop,
25(1)48,
25(1)116,
26(3)282,
27(1)42,
29(1)33,
29(5)430,
30(1)27
- multiple,
25(1)22,
27(1)83,
28(3)343,
28(4)414,
29(5)390,
30(2)110,
30(2)119,
30(5)386,
30(5)404,
30(6)529,
30(6)535,
31(3)209,
31(4)304
- new,
23(1)3,
23(1)28,
23(4)324,
24(4)320,
25(2)176,
27(4)310,
27(4)368-1,
28(2)184,
28(3)291,
29(1)33,
29(5)467,
29(6)522,
32(5)470
- polynomial,
23(2)187-1,
29(2)103,
32(5)474
- time,
23(1)34,
23(2)147,
23(2)153,
23(3)262,
23(4)290,
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(2)105,
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