Entry Santoro:1985:LIR from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
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{Santoro:1985:LIR,
author = "Nicola Santoro and Ramez Khatib",
title = "Labelling and Implicit Routing in Networks",
journal = j-COMP-J,
volume = "28",
number = "1",
pages = "5--8",
month = feb,
year = "1985",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/28.1.5",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68M10",
MRnumber = "86e:68012",
bibdate = "Tue Dec 4 14:48:18 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/28/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/28/1/5.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_01/tiff/5.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_01/tiff/6.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_01/tiff/7.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_01/tiff/8.tif",
acknowledgement = ack-nhfb,
affiliation = "Carleton Univ, Distributed Computing Group, Ottawa,
Ont, Can",
affiliationaddress = "Carleton Univ, Distributed Computing Group,
Ottawa, Ont, Can",
classcodes = "B0250 (Combinatorial mathematics); B6150
(Communication system theory); B6210L (Computer
communications); C1160 (Combinatorial mathematics);
C5620 (Computer networks and techniques)",
classification = "723; 921",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "a priori labelling; acyclic graphs; algorithm;
arbitrary topology; communication; computer networks;
computer programming --- Algorithms; graph theory;
implicit routing; labeling; labelling scheme;
mathematical techniques --- Graph Theory; networks;
optimal; routing algorithms; switching theory;
topologies; worst-case complexity",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 68M10,
30(4)298,
31(4)289
- acyclic,
27(1)86,
31(6)545,
32(3)228
- arbitrary,
25(1)32,
25(1)114,
30(4)298,
30(5)425,
30(5)437,
31(4)289,
31(4)325,
32(4)362
- case, worst-,
25(3)347,
27(3)201,
29(5)390,
31(3)276
- communication, 23-3-255b-255,
23(4)369,
24(1)25,
24(1)78,
25(1)22,
25(1)87,
25(2)161,
25(4)410,
25(4)494,
26(3)247,
28(3)200,
29(2)109,
29(6)506,
30(3)254,
30(5)437,
30(5)458,
31(2)175,
31(4)289,
31(4)296,
32(3)252,
32(3)262,
32(3)267,
32(4)362,
32(5)461
- complexity,
25(1)63,
25(3)379,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)340,
28(1)78,
28(5)487,
28(5)496,
29(2)103,
29(2)161,
29(2)176,
29(2)182,
29(4)300,
29(4)322,
29(4)330,
29(5)451,
30(1)43,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)258,
30(3)282,
30(4)308,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)545,
31(6)553,
31(6)561,
31(6)567,
32(4)362,
32(5)474
- graph,
23(3)237,
24(1)85,
25(3)338,
25(3)397,
27(1)86,
27(2)165,
28(1)44,
28(1)78,
28(2)105,
29(6)531,
29(6)553,
30(1)16,
30(1)20,
30(2)128,
30(6)498,
31(1)71,
31(1)76,
31(2)155,
31(3)253,
31(4)289,
31(4)304,
31(6)545,
32(1)45,
32(2)175,
32(4)290,
32(5)461,
32(5)474
- implicit,
32(5)399
- labeling,
28(2)105
- labelling,
28(2)105,
30(2)176
- mathematical,
24(2)177,
24(2)180,
24(2)184,
25(1)7,
25(1)56,
25(4)478,
26(1)6,
26(2)97,
26(2)106,
26(3)193,
27(2)165,
27(4)368-1,
28(1)78,
28(1)89,
28(2)142,
28(2)179,
28(4)414,
28(4)417,
28(4)426,
28(5)498,
28(5)524,
28(5)530,
28(5)538,
29(1)36,
29(1)52,
29(2)171,
29(2)176,
29(2)182,
29(4)378,
29(5)416,
29(6)553,
30(1)16,
30(1)20,
30(1)70,
30(2)128,
30(2)189,
30(3)258,
30(3)268,
30(3)282,
30(4)298,
30(5)458,
30(6)498,
30(6)569,
31(1)61,
31(1)71,
31(1)76,
31(2)155,
31(3)229,
31(3)243,
31(3)283,
31(4)364,
31(6)490,
31(6)545,
31(6)557,
31(6)564,
31(6)567,
32(1)45,
32(1)68,
32(1)76,
32(1)86,
32(1)93,
32(2)175,
32(4)351,
32(4)374,
32(4)377
- optimal,
23(4)347,
25(1)32,
25(1)93,
25(2)183,
25(2)239,
25(3)338,
27(4)321,
28(1)17,
28(5)524,
29(1)52,
29(2)161,
29(2)182,
30(4)298,
30(5)433,
31(4)344,
32(3)194,
32(3)246
- priori,
31(4)289
- routing,
25(1)87,
30(4)298,
31(4)296
- scheme,
24(3)256,
24(4)324,
25(2)235,
25(3)358,
26(1)10,
26(2)188,
27(1)18,
28(4)375,
29(2)109,
29(3)277,
30(2)189,
30(3)249,
30(4)298,
30(4)328,
32(1)16
- switching,
23(1)73,
28(3)231,
28(4)375
- topology,
23(3)270,
23(4)324,
25(1)87,
27(3)254,
31(4)289,
31(4)296
- worst-case,
25(3)347,
27(3)201,
29(5)390,
31(3)276