Entry Hromkovic:1994:NOG from tcs1990.bib
Last update: Wed Sep 26 02:11:46 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{Hromkovic:1994:NOG,
author = "Juraj Hromkovi{\v{c}} and Claus-Dieter Jeschke and
Burkhard Monien",
title = "Note on optimal gossiping in some weak-connected
graphs",
journal = j-THEOR-COMP-SCI,
volume = "127",
number = "2",
pages = "395--402",
day = "23",
month = may,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:08 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=127&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=127&issue=2&aid=1589",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); B6210L (Computer
communications); C1160 (Combinatorial mathematics);
C5620 (Computer networks and techniques)",
corpsource = "Fachbereich Math.-Inf., Univ. Gesamthochschule
Paderborn, Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "broadcast problem; broadcasting; computer networks;
cycles; edge disjoint cycles; graph theory; graphs;
lower bounds; one-way communication mode; optimal
algorithms; optimal gossiping; paths; trees;
weak-connected graphs",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- B0250,
71(1)133,
75(3)311,
79(1)179,
91(1)119,
92(2)227,
92(2)291,
94(2)261,
95(2)307,
99(2)231,
100(1)243,
110(1)79,
110(1)197,
115(2)359,
117(1)3,
117(1)23,
117(1)45,
117(1)67,
117(1)99,
117(1)137,
117(1)169,
117(1)199,
117(1)227,
117(1)243,
117(1)273,
117(1)289,
117(1)z,
119(2)331,
123(1)89,
123(1)145,
123(2)351,
123(2)377,
124(2)329,
129(2)385,
132(1)209,
132(1)337,
134(1)87,
134(2)455
- B6210L,
108(2)291,
125(1)111,
125(1)149
- bound,
72(2)251,
73(3)313,
74(2)121,
74(3)313,
74(3)329,
81(2)237,
82(1)19,
82(1)113,
82(1)157,
83(2)169,
85(1)155,
85(2)305,
86(2)267,
88(1)59,
91(2)265,
92(1)191,
93(2)279,
96(2)411,
97(2)233,
97(2)285,
98(2)289,
100(1)185,
100(1)223,
102(2)215,
102(2)253,
102(2)355,
106(2)221,
106(2)351,
107(1)77,
107(1)121,
108(2)251,
108(2)271,
108(2)311,
110(1)1,
112(2)355,
112(2)419,
113(1)75,
116(1)195,
116(2)305,
116(2)415,
119(2)267,
120(2)169,
121(1)279,
123(1)95,
123(1)145,
123(2)377,
123(2)389,
125(2)329,
125(2)373,
128(1)63,
129(1)193,
129(2)263,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)85,
130(1)163,
130(1)175,
131(2)243,
131(2)331,
132(1)259,
132(1)377,
132(1)387,
133(1)23,
133(1)105,
134(1)189,
134(1)253,
136(2)527
- broadcast,
101(2)289,
124(2)329
- broadcasting,
124(2)329
- C5620,
84(1)23,
91(1)57,
100(1)223,
108(2)291,
125(1)45,
125(1)111,
125(1)149,
125(2)373,
128(1)31
- communication,
71(1)3,
80(2)263,
87(1)43,
97(2)285,
100(1)185,
100(1)223,
101(2)289,
106(2)385,
110(2)341,
120(2)261,
124(2)329,
125(2)373,
127(1)123,
127(2)387,
128(1)31,
128(1)63,
132(1)259,
135(2)171
- communications,
87(1)43,
108(2)291,
125(1)111,
125(1)149
- computer,
70(1)3,
71(1)47,
73(1)1,
73(1)101,
74(3)273,
75(1)z,
77(1)73,
77(1)161,
77(1)195,
77(3)321,
79(1)37,
79(1)195,
79(1)209,
84(1)23,
84(1)77,
84(1)127,
86(2)205,
90(1)1,
90(1)253,
91(1)57,
92(1)49,
92(1)77,
94(1)125,
96(1)175,
100(1)223,
102(1)1,
108(2)291,
116(2)227,
116(2)291,
116(2)373,
117(1)z,
119(1)z,
120(2)215,
122(1)1,
123(1)117,
123(1)z,
125(1)45,
125(1)111,
125(1)131,
125(1)149,
125(2)373,
128(1)3,
128(1)31,
130(1)17,
134(1)51,
136(2)387
- cycle,
71(3)419,
84(2)179,
106(2)265,
117(1)3,
117(1)243,
119(2)331,
131(2)463,
132(1)1
- disjoint,
76(1)53,
83(2)275,
91(2)239,
102(2)283,
103(1)107,
115(2)351,
117(1)187,
124(2)195,
126(1)31,
129(2)369,
133(1)49,
134(1)225,
136(2)333
- edge,
71(3)401,
74(3)299,
75(3)357,
84(2)179,
86(2)205,
102(2)283,
112(2)371,
112(2)419,
116(1)151,
128(1)241,
131(2)361
- Hromkovi{\v{c}}, Juraj,
108(2)393,
127(1)123,
132(1)319
- lower,
74(3)313,
81(2)237,
82(1)113,
82(1)157,
83(2)169,
92(1)191,
93(2)279,
96(2)411,
97(2)285,
102(2)215,
106(2)351,
108(2)271,
111(1)59,
112(2)355,
112(2)419,
113(1)75,
116(2)415,
119(2)267,
123(2)389,
125(2)373,
128(1)63,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)163,
130(1)175,
130(1)203,
131(2)243,
131(2)331,
133(1)23,
134(1)253
- mode,
108(2)345
- Monien, Burkhard,
116(2)421,
123(2)427
- network,
73(1)61,
74(1)19,
75(3)357,
76(2)331,
80(2)337,
84(1)23,
86(2)343,
87(1)43,
90(2)355,
91(1)57,
91(2)129,
100(1)223,
102(2)329,
102(2)355,
104(2)285,
107(2)305,
108(2)291,
116(2)359,
116(2)415,
120(2)215,
120(2)261,
124(2)329,
125(1)45,
125(1)61,
125(1)111,
125(1)149,
125(2)373,
127(2)313,
128(1)31,
128(1)63,
128(1)127,
130(1)49,
130(1)73,
130(1)175,
131(2)331,
132(1)113,
134(1)51
- note,
70(1)73,
73(1)101,
78(2)357,
83(1)157,
88(2)287,
94(2)367,
95(1)115,
108(2)393,
112(2)383,
112(2)391,
123(1)3,
131(2)441,
132(1)435
- one-way,
81(1)155,
83(2)337,
84(1)23,
85(1)53,
85(1)135,
88(2)287,
96(2)305,
96(2)411,
108(2)393,
119(2)233,
129(2)309,
132(1)259
- optimal,
71(3)401,
74(1)95,
74(2)183,
76(1)93,
76(2)331,
77(3)291,
80(1)105,
81(2)257,
82(1)113,
82(1)157,
84(1)127,
84(2)179,
85(1)155,
86(2)365,
87(2)251,
92(1)33,
92(1)87,
92(1)z,
93(2)245,
106(2)361,
108(2)271,
111(1)191,
115(2)351,
119(2)355,
120(2)197,
120(2)261,
123(2)377,
125(1)91,
128(1)179,
129(2)323,
130(1)17,
132(1)403,
134(2)263,
134(2)559
- path,
72(2)251,
72(2)z,
74(2)199,
74(3)355,
79(1)151,
79(1)179,
83(2)189,
84(1)127,
84(2)179,
84(2)281,
88(1)33,
88(1)151,
89(1)33,
94(1)141,
95(2)245,
100(1)243,
102(2)329,
105(1)129,
106(2)391,
112(2)255,
115(2)351,
116(2)359,
117(1)137,
117(1)187,
117(1)203,
125(2)345,
131(1)1,
133(1)65
- way, one-,
81(1)155,
83(2)337,
84(1)23,
85(1)53,
85(1)135,
88(2)287,
96(2)305,
96(2)411,
108(2)393,
119(2)233,
129(2)309,
132(1)259