Entry Jansen:1995:MBT from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Jansen:1995:MBT,
author = "Klaus Jansen and Haiko M{\"u}ller",
title = "The minimum broadcast time problem for several
processor networks",
journal = j-THEOR-COMP-SCI,
volume = "147",
number = "1--2",
pages = "69--85",
day = "07",
month = aug,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:16 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=147&issue=1-2&aid=1864",
acknowledgement = ack-nhfb,
classification = "B6210L (Computer communications); C1160
(Combinatorial mathematics); C4240C (Computational
complexity); C5620 (Computer networks and techniques)",
corpsource = "Fachbereich IV-Math. und Inf., Trier Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bipartite planar graphs; broadcasting; chordal graphs;
communication network; complete grid graphs;
computational complexity; computer networks; graph
theory; grid graphs; information dissemination process;
minimum broadcast time problem; NP-completeness;
processor networks; split graphs; unique message",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- B6210L,
145(1)95,
177(2)425,
178(1)103,
196(1)31,
196(1)45
- bipartite,
145(1)381,
147(1)267,
148(1)93,
159(1)105,
159(1)137,
175(2)337
- broadcast,
165(2)407,
200(1)313
- broadcasting,
198(1)99,
200(1)225,
203(1)3
- C5620,
178(1)103,
178(1)119,
185(2)347,
196(1)31,
196(1)45
- chordal,
140(2)291,
172(1)209
- communication,
140(2)319,
144(1)3,
149(2)257,
155(1)179,
156(1)99,
157(2)139,
168(1)39,
170(1)445,
177(2)329,
177(2)425,
177(2)487,
178(1)103,
178(1)119,
185(2)259,
185(2)347,
188(1)117,
192(2)167,
194(1)123,
196(1)153,
196(1)181,
198(1)99,
209(1)195,
209(1)195,
215(1)137,
220(1)3,
220(1)185
- communications,
138(2)315,
145(1)95,
147(1)1,
154(1)57,
177(2)425,
178(1)103,
196(1)31,
196(1)45
- complete,
138(2)273,
138(2)391,
141(1)337,
142(2)209,
143(1)51,
145(1)147,
146(1)243,
146(1)321,
147(1)1,
147(1)137,
152(2)251,
154(1)107,
154(2)247,
154(2)283,
160(1)185,
160(1)241,
161(1)307,
164(1)141,
164(1)287,
166(1)203,
168(1)53,
168(1)155,
170(1)145,
170(1)245,
172(1)195,
176(1)89,
179(1)421,
183(2)229,
184(1)61,
184(1)237,
189(1)239,
190(2)279,
192(2)259,
192(2)315,
193(1)53,
195(1)61,
197(1)244-2,
206(1)331,
211(1)339,
220(2)363,
221(1)157
- completeness;, NP-,
165(2)483,
168(1)3,
175(2)349,
188(1)129
- computer,
134(1)51,
138(1)35,
138(1)67,
140(2)249,
140(2)319,
145(1)95,
145(1)159,
147(1)1,
147(1)211,
152(2)321,
154(1)57,
154(2)165,
156(1)1,
156(1)159,
156(1)203,
157(1)115,
157(1)z,
159(1)105,
170(1)245,
170(1)407,
175(1)z,
175(2)225,
175(2)293,
177(2)425,
178(1)103,
178(1)119,
178(1)225,
179(1)319,
181(1)75,
185(2)347,
186(1)1,
187(1)123,
187(1)147,
187(1)263,
187(1)z,
191(1)1,
191(1)173,
191(1)245,
192(2)315,
194(1)242-1,
196(1)31,
196(1)45,
196(1)215,
197(1)57,
197(1)139,
201(1)99,
211(1)233
- grid,
134(1)51,
147(1)1,
154(2)349,
175(2)293,
196(1)259
- information,
139(1)163,
143(2)319,
146(1)145,
152(2)171,
154(2)165,
154(2)283,
155(1)221,
158(1)193,
158(1)343,
158(1)361,
159(2)319,
161(1)235,
163(1)117,
163(1)303,
164(1)253,
167(1)131,
168(2)367,
171(1)179,
172(1)1,
177(2)425,
178(1)129,
181(2)337,
182(1)245,
186(1)1,
188(1)1,
190(2)167,
192(1)77,
192(2)259,
194(1)243,
194(1)248-1,
195(1)33,
199(1)167,
207(2)319,
209(1)87,
209(1)195,
209(1)195
- Jansen, Klaus,
148(1)93,
221(1)119
- message,
138(2)315,
151(1)195,
165(2)407,
169(1)39,
192(2)201,
195(2)291,
196(1)71,
198(1)99
- minimum,
140(2)291,
158(1)117,
163(1)269,
165(2)311,
174(1)23,
175(2)309,
181(1)57,
181(2)267,
181(2)347,
185(2)319,
188(1)1,
194(1)207,
206(1)301,
225(1)113
- NP-completeness,
165(2)483,
168(1)3,
175(2)349,
188(1)129
- planar,
140(2)301,
143(2)309,
145(1)27,
154(1)3,
159(1)137,
172(1)303,
175(2)239,
181(1)57,
203(1)123,
215(1)225
- processor,
140(2)333,
141(1)1,
146(1)69,
146(1)109,
147(1)1,
147(1)249,
154(2)225,
155(1)141,
155(2)349,
155(2)411,
162(2)225,
162(2)323,
162(2)341,
168(1)121,
169(1)39,
173(1)209,
174(1)193,
178(1)119,
178(1)265,
179(1)251,
179(1)381,
181(2)357,
181(2)379,
183(2)281,
186(1)171,
188(1)221,
190(2)211,
196(1)347
- several,
144(1)59,
157(1)79,
207(2)329,
210(2)341
- split,
148(1)93
- unique,
145(1)329,
172(1)309,
176(1)205