Entry Dahlhaus:1988:PCP from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
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{Dahlhaus:1988:PCP,
author = "Elias Dahlhaus and Marek Karpinski",
title = "Parallel construction of perfect matchings and
{Hamiltonian} cycles on dense graphs",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "121--136",
month = nov,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Bonn",
affiliationaddress = "Bonn, West Ger",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C5320G
(Semiconductor storage)",
corpsource = "Dept. of Comput. Sci., Bonn Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; communications; Computer Programming;
Computer Systems, Digital--Parallel Processing;
Concurrent Read-Exclusive Write; CREW-PRAM; dense graph
combinatorics; dense graphs; Dense Graphs; distributed
algorithms; graph theory; Hamiltonian cycles;
Hamiltonian Cycles; Mathematical Techniques--Graph
Theory; parallel algorithms; Parallel Algorithms;
parallel algorithms; parallel construction; Parallel
Random Access Machines; perfect matchings; Perfect
Matchings; random-access storage; routing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- access,
38(1)1,
39(2)89,
58(0)3,
58(1)3,
58(1)379,
63(2)203
- access, random-,
47(3)315,
48(1)53,
58(1)379,
59(3)297
- C5320G,
48(1)53,
58(1)379,
59(3)297
- communications,
40(2)101,
49(2)145,
54(1)53
- concurrent,
36(1)27,
38(1)1,
38(2)193,
39(2)107,
40(2)149,
43(2)213,
43(2)277,
45(1)1,
46(2)285,
49(2)185,
50(3)241,
51(3)281,
55(1)1,
55(1)87,
56(1)37,
58(0)3,
58(1)3,
58(1)183,
58(1)263,
58(1)347,
58(1)379,
59(1)25,
60(1)1,
61(1)93,
64(3)221,
64(3)281,
65(1)35,
66(0)117,
66(2)117,
66(3)333,
69(1)69
- construction,
36(1)99,
37(3)269,
39(1)3,
40(2)315,
43(1)43,
44(2)229,
54(2)165,
61(2)225,
63(2)157,
65(2)171,
68(2)175
- cycle,
36(2)231,
40(2)275,
41(1)19,
44(2)209,
52(3)193
- dense,
43(2)337,
44(1)107,
46(1)47
- Digital--Parallel,
58(1)249,
58(1)347,
59(3)277,
59(3)297,
61(2)199,
64(2)159,
64(2)191,
64(3)271,
66(0)117,
66(2)117
- distributed,
37(2)183,
39(1)47,
43(2)277,
49(2)145,
49(2)171,
49(2)267,
49(2)z,
52(1)155,
52(3)193,
53(2)281,
54(1)53,
58(0)3,
58(1)249,
63(1)63,
64(1)125,
64(3)221,
64(3)281,
68(2)203
- Graph, Techniques-,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
64(2)159,
67(1)5
- Hamiltonian,
41(2)141,
57(1)131,
64(1)125
- matching,
41(2)141,
43(2)189,
43(2)239,
51(3)341,
54(1)129,
60(3)231,
64(1)125,
66(1)99
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- Parallel, Digital-,
58(1)249,
58(1)347,
59(3)277,
59(3)297,
61(2)199,
64(2)159,
64(2)191,
64(3)271,
66(0)117,
66(2)117
- perfect,
59(3)297
- processing,
35(2)191,
36(2)173,
37(2)183,
37(3)245,
37(3)305,
39(1)47,
39(2)107,
43(1)31,
43(1)43,
43(2)213,
43(2)277,
48(2)145,
49(2)145,
49(2)171,
49(2)267,
50(3)241,
51(1)239,
52(1)155,
52(3)193,
53(2)281,
54(1)53,
55(2)291,
57(0)3,
57(1)131,
58(1)143,
58(1)183,
58(1)249,
58(1)347,
59(3)259,
59(3)277,
59(3)297,
61(2)199,
62(1)67,
62(1)123,
62(3)251,
63(1)91,
64(1)83,
64(1)125,
64(2)135,
64(2)159,
64(2)175,
64(2)191,
64(3)271,
65(2)249,
66(0)117,
66(2)117,
66(2)181,
68(3)343,
69(1)1
- random,
38(1)69,
39(2)89,
41(1)1,
43(2)169,
53(1)99,
53(1)z,
56(3)303,
58(1)379,
63(2)203
- random-access,
47(3)315,
48(1)53,
58(1)379,
59(3)297
- routing,
48(1)75,
53(2)281,
64(1)83,
64(2)191,
64(2)203
- Semiconductor,
48(1)53,
57(1)97,
58(1)379,
59(3)297
- storage,
39(2)267,
48(1)53,
54(2)325,
58(1)379,
59(3)259,
59(3)297
- Techniques--Graph,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
64(2)159,
67(1)5
- Write,
58(1)379