Entry Garey:1976:SSN from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 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 |
Y |
Z
BibTeX entry
@Article{Garey:1976:SSN,
author = "M. R. Garey and D. S. Johnson",
title = "Some simplified {NP-complete} graph problems",
journal = j-THEOR-COMP-SCI,
volume = "1",
number = "3",
pages = "237--267",
month = feb,
year = "1976",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Bell Labs., Murray Hill, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "directed Hamiltonian path problems; graph; graph
theory; node cover; NP complete; optimal linear
arrangement; simple max cut; upper bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- arrangement,
4(2)171
- B0250,
1(2)185,
2(3)339,
3(1)51,
3(3)371,
5(2)179
- bound,
1(1)1,
1(4)355,
2(2)249,
2(3)305,
3(2)213,
3(2)267,
5(1)1,
6(1)25,
7(3)251
- C1160,
1(2)185,
2(3)305,
2(3)339,
3(1)51,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(3)257,
6(1)93,
6(3)281,
7(2)217,
8(1)13,
8(1)45,
9(2)265
- combinatorial,
1(2)95,
1(2)185,
2(3)305,
2(3)339,
3(1)51,
3(2)183,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(3)257,
6(1)93,
6(3)281,
7(2)217,
7(3)325,
8(1)13,
8(1)45,
9(2)265
- complete,
3(1)23,
3(1)105,
4(2)125,
6(1)69,
6(1)93,
7(3)273,
8(1)73,
8(2)227,
9(1)67
- complete, NP-,
4(3)237,
5(2)179
- directed,
4(3)277
- graph,
2(3)305,
2(3)339,
3(3)371,
4(3)277,
5(1)51,
6(1)93,
6(3)281,
9(2)265
- Johnson, D. S.,
6(1)93
- linear,
1(2)161,
1(3)227,
2(1)49,
2(3)305,
2(3)361,
7(1)117,
7(2)127,
7(3)251,
8(2)189,
8(3)359
- mathematics,
1(2)185,
2(1)9,
2(3)305,
2(3)339,
3(1)51,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(2)211,
5(3)257,
6(1)69,
6(1)93,
6(3)255,
6(3)281,
7(1)25,
7(1)117,
7(2)217,
7(3)325,
8(1)13,
8(1)45,
9(1)27,
9(1)99,
9(2)265
- node,
4(2)155
- NP,
6(1)93,
7(3)273
- NP-complete,
4(3)237,
5(2)179
- optimal,
4(3)301,
7(1)1,
7(2)127,
7(3)239
- problem,
1(1)77,
1(4)297,
2(1)77,
2(3)361,
3(1)1,
3(1)75,
3(1)85,
3(1)105,
3(2)123,
3(2)183,
3(3)283,
3(3)293,
4(1)99,
4(2)137,
4(3)237,
4(3)245,
4(3)277,
5(2)179,
6(1)93,
6(2)223,
6(3)317,
7(1)25,
7(2)149,
7(2)169,
8(1)1,
8(1)89,
8(2)135,
8(2)189,
9(2)173,
9(2)377
- simple,
1(4)297,
3(3)321,
6(3)281,
9(2)287,
9(2)311