Entry Garcia-Luna-Aceves:1989:MHR from compnetisdn.bib
Last update: Fri Jan 5 02:05:58 MST 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{Garcia-Luna-Aceves:1989:MHR,
author = "Jose Joaquin Garcia-Luna-Aceves",
title = "A Minimum-Hop Routing Algorithm Based on Distributed
Information",
journal = j-COMP-NET-ISDN,
volume = "16",
number = "5",
pages = "367--382",
month = may,
year = "1989",
CODEN = "CNISE9",
ISSN = "0169-7552 (print), 1879-2324 (electronic)",
ISSN-L = "0169-7552",
bibdate = "Sat Sep 25 23:08:50 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Distributed/CCR.bib;
http://www.math.utah.edu/pub/tex/bib/compnetisdn.bib",
acknowledgement = ack-nhfb,
affiliation = "SRI Int",
affiliationaddress = "Menlo Park, USA",
classification = "703; 723",
journal-URL = "http://www.sciencedirect.com/science/journal/01697552",
journalabr = "Comput Networks ISDN Syst",
keywords = "Computer Networks--Computation; Computer Programming;
Distributed Algorithms; Electric Networks,
Communication--Theory; Minimum Hop Paths; Routing;
Routing Algorithm; Shortest Path",
}
Related entries
- algorithm,
9(2)109,
9(4)257,
9(4)297,
10(5)245,
11(1)1,
11(1)43,
12(1)27,
12(2)81,
12(2)89,
12(2)99,
12(3)139,
12(3)147,
12(5)311,
13(4)269,
13(4)301,
14(2)389,
15(1)1,
15(5)329,
16(3)179,
16(5)383,
17(1)1,
17(1)29,
17(2)127,
17(3)201,
18(5)355,
18(z)243,
22(4)235,
22(4)265,
24(1)81,
25(10)1107,
26(2)227,
26(6)695,
26(9)1215,
26(11)1385,
27(2)255,
28(7)1037,
29(2)237,
29(3)343,
29(14)1587,
29(14)1661,
29(14)1705,
29(14)1737,
29(17)2053,
30(1)317,
30(11)1029,
30(20)1833,
30(22)2203,
30(24)2309
- based,
12(3)159,
13(2)119,
13(4)257,
14(2)221,
17(1)29,
18(13)1845,
20(1)137,
20(1)189,
22(1)7,
23(5)363,
24(2)119,
24(4)311,
25(1)23,
25(6)631,
25(7)791,
25(10)1065,
26(1)5,
26(3)316,
26(3)349,
26(11)1365,
27(2)205,
27(6)953,
27(8)1247,
27(9)1399,
28(13)1845,
28(14)1887,
28(14)1939,
29(3)373,
29(5)555,
29(14)1611,
29(14)1635,
29(16)1857,
30(1)672,
30(14)1341,
30(16)1447,
30(16)1543,
30(20)1887
- Communication--Theory,
16(4)299
- Electric,
16(4)267,
16(4)299,
17(2)89,
17(2)101,
17(2)111
- minimum,
13(1)15,
26(2)227
- path,
9(4)257,
12(1)27,
24(5)405,
25(6)663,
25(8)947,
28(3)391,
29(3)373,
29(16)1857,
30(1)457
- programming,
9(2)91,
9(2)109,
9(4)257,
10(5)245,
11(1)1,
11(1)43,
12(1)27,
12(2)81,
12(2)99,
12(3)139,
12(3)147,
12(5)311,
13(2)65,
13(2)75,
13(2)91,
13(2)97,
13(2)119,
13(4)301,
14(1)25,
14(1)61,
14(2)187,
14(3)3,
15(1)1,
15(2)121,
15(4)245,
15(5)329,
16(1)138,
16(5)383,
17(2)127,
26(z)z-1,
27(2)193,
27(2)289,
27(6)823,
27(6)831,
27(6)841,
28(7)1037,
28(7)1149,
28(7)1291,
28(7)1373,
30(1)259
- routing,
9(2)109,
9(4)257,
9(4)297,
11(1)1,
11(3)203,
12(1)27,
12(2)89,
12(3)147,
15(5)329,
18(5)355,
20(1)137,
20(1)189,
20(1)369,
22(3)179,
22(4)235,
23(1)185,
23(4)241,
24(5)405,
25(3)275,
25(4)405,
25(4)535,
25(6)645,
26(2)195,
26(4)403,
26(6)859,
26(6)985,
26(6)1023,
27(1)101,
27(6)953,
27(12)1633,
28(3)325,
28(3)401,
28(6)743,
29(6)631,
29(16)1901,
30(8)795,
30(12)1157,
30(22)2193,
30(22)2269,
30(24)2349
- shortest,
12(1)27,
12(2)81
- Theory;, Communication-,
16(4)299