Last update: Fri Jul 8 02:02:43 MDT 2005
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{Greenlaw:1993:BSP,
author = "R. Greenlaw",
title = "Breadth-depth search is {P}-complete",
journal = j-PARALLEL-PROCESS-LETT,
volume = "3",
number = "3",
pages = "209--222",
month = sep,
year = "1993",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Mon Apr 14 09:48:53 MDT 1997",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., New Hampshire Univ., Durham,
NH, USA",
countrypub = "Singapore",
keywords = "branch-and-bound strategies; breadth-depth search;
breadth-first search; complexity; computational
complexity; decision problem; depth-first search; fixed
ordered adjacency; lists; P-complete; parallel
algorithms; parallel complexity; problems; search;
search strategy; sequential; vertex numbers",
treatment = "T Theoretical or Mathematical",
}
Related entries
- adjacency,
1(2)125
- and-bound, branch-,
4(1)3,
5(3)375
- bound, branch-and-,
4(1)3,
5(3)375
- branch-and-bound,
4(1)3,
5(3)375
- C1160,
1(1)19,
1(2)125,
1(2)135,
2(1)31,
2(2)195,
2(2)205,
2(2)213,
2(2)231,
2(2)241,
2(2)249,
2(4)301,
3(1)13,
3(1)79,
3(1)99,
3(2)115,
3(2)165,
3(3)223,
3(3)233,
3(3)253,
3(4)431,
3(4)457,
4(1)29,
4(1)37,
4(1)65,
4(1)105,
4(3)259,
4(3)281,
4(4)379,
4(4)385,
4(4)429,
5(1)63,
5(1)81,
5(2)149,
5(2)231,
5(2)293,
5(3)413,
5(4)527,
5(4)599,
5(4)611,
5(4)671,
6(1)35,
6(1)137,
6(1)159,
6(2)213,
6(3)321,
6(3)389,
6(4)439,
6(4)469,
6(4)479,
6(4)539,
6(4)551,
6(4)583,
7(1)25
- combinatorial,
1(1)19,
1(2)125,
1(2)135,
2(1)31,
2(2)195,
2(2)205,
2(2)213,
2(2)231,
2(2)241,
2(2)249,
2(4)301,
3(1)3,
3(1)13,
3(1)25,
3(1)79,
3(1)99,
3(2)115,
3(2)165,
3(3)223,
3(3)233,
3(3)253,
3(4)431,
3(4)457,
4(1)29,
4(1)37,
4(1)65,
4(1)105,
4(3)259,
4(3)281,
4(4)379,
4(4)385,
4(4)429,
5(1)63,
5(1)81,
5(2)149,
5(2)231,
5(2)251,
5(2)293,
5(3)375,
5(3)413,
5(4)527,
5(4)599,
5(4)611,
5(4)671,
6(1)35,
6(1)137,
6(1)159,
6(2)213,
6(3)321,
6(3)389,
6(4)439,
6(4)469,
6(4)479,
6(4)539,
6(4)551,
6(4)583,
7(1)25
- complete, {P}-,
5(2)293
- decision,
3(1)3,
4(3)205
- depth-first,
5(2)129
- first, depth-,
5(2)129
- fixed,
4(1)171
- Greenlaw, R.,
2(1)31
- list,
2(4)321,
4(1)15,
5(2)179,
5(2)191,
6(1)75,
12(3)375
- mathematics,
1(1)19,
1(2)125,
1(2)135,
2(1)31,
2(1)61,
2(1)81,
2(2)195,
2(2)205,
2(2)213,
2(2)231,
2(2)241,
2(2)249,
2(4)301,
3(1)13,
3(1)79,
3(1)99,
3(2)115,
3(2)165,
3(3)223,
3(3)233,
3(3)243,
3(3)253,
3(4)431,
3(4)457,
4(1)29,
4(1)37,
4(1)65,
4(1)105,
4(1)171,
4(3)259,
4(3)281,
4(4)379,
4(4)385,
4(4)429,
4(4)477,
5(1)3,
5(1)63,
5(1)81,
5(2)149,
5(2)157,
5(2)231,
5(2)251,
5(2)293,
5(3)413,
5(4)527,
5(4)599,
5(4)611,
5(4)671,
6(1)35,
6(1)137,
6(1)159,
6(2)213,
6(3)321,
6(3)365,
6(3)389,
6(4)439,
6(4)469,
6(4)479,
6(4)539,
6(4)551,
6(4)583,
7(1)25,
8(2)149
- number,
2(4)355,
3(1)71,
3(4)375,
4(3)259,
5(2)321,
7(1)13
- ordered,
3(3)253,
5(4)575
- search,
2(2)171,
4(1)3,
5(2)129,
7(2)157,
8(3)387,
9(4)575,
14(1)23
- sequential,
2(1)31,
2(2)291,
3(1)87,
3(4)445,
4(1)3,
4(3)301,
5(2)205,
5(2)293,
5(3)367,
6(3)415,
6(4)451,
12(2)267,
13(1)53
- strategy,
2(2)139,
2(2)221,
3(2)189,
4(3)329,
5(2)231,
5(4)575,
5(4)623,
6(1)45,
6(1)75,
6(4)469,
6(4)551,
7(2)157,
7(3)237,
13(2)225,
14(1)33
- vertex,
1(2)135,
3(3)223,
3(3)233,
3(4)431,
4(4)379,
6(1)137,
6(3)321
- {P}-complete,
5(2)293