Entry VanLeeuwen:1987:IR 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{VanLeeuwen:1987:IR,
author = "J. {Van Leeuwen} and R. B. Tan",
title = "Interval Routing",
journal = j-COMP-J,
volume = "30",
number = "4",
pages = "298--307",
month = aug,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.4.298",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68M10 (68R10)",
MRnumber = "88g:68009",
bibdate = "Tue Dec 4 14:48:23 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/4.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/30/4/298.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/298.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/299.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/300.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/301.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/302.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/303.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/304.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/305.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/306.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/307.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Utrecht, Utrecht, Neth",
affiliationaddress = "Univ of Utrecht, Utrecht, Neth",
classcodes = "B6210L (Computer communications); C5620 (Computer
networks and techniques); C6150J (Operating systems)",
classification = "723; 921",
corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "arbitrary networks; compact routing; compact routing
tables; computer networks; computer programming ---
Algorithms; computer systems, digital --- Distributed;
distributed computing; distributive network; generation
of spanning trees; interval routing; interval routing
scheme; leader-finding; mathematical techniques ---
Trees; network operating systems; optimal interval
routing schemes; spanning trees; using",
treatment = "P Practical",
}
Related entries
- 68M10,
28(1)5,
31(4)289
- 68R10,
28(1)78,
30(6)569,
31(1)61,
31(6)564,
32(1)68,
32(5)470,
32(5)474
- arbitrary,
25(1)32,
25(1)114,
28(1)5,
30(5)425,
30(5)437,
31(4)289,
31(4)325,
32(4)362
- compact,
27(1)18,
27(3)225,
28(4)379,
29(4)307,
32(5)445
- computing,
23(1)85,
23(4)324,
23(4)347,
23(4)353,
24(1)52,
24(1)96,
24(2)162,
24(2)167,
25(1)22,
25(2)188,
25(2)207,
25(2)287,
25(3)338,
25(3)397,
26(2)187,
26(2)187,
26(3)224,
26(4)296,
27(1)8,
27(2)97,
27(3)193,
28(2)117,
28(3)243,
28(5)498,
29(2)161,
29(3)229,
29(4)348,
29(4)373,
30(1)20,
30(2)110,
30(3)193,
30(3)258,
30(3)268,
30(3)277,
30(3)282,
30(5)413,
30(5)420,
30(5)437,
31(1)12,
31(2)175,
31(2)182,
31(3)201,
31(4)364,
31(6)567,
32(3)281,
32(4)362,
32(4)370,
32(5)385,
32(5)437,
32(5)453
- distributive,
25(1)102
- generation,
24(2)173,
25(2)176,
25(2)183,
25(3)316,
25(4)423,
26(2)97,
27(4)354,
28(1)17,
28(4)414,
28(4)433,
28(4)444,
29(2)151,
29(3)246,
29(3)282,
29(4)289,
29(4)315,
29(6)486,
30(1)37,
30(1)63,
30(3)193,
30(3)282,
30(6)551,
31(1)61,
32(3)281,
32(5)445,
32(5)470,
32(6)554
- interval,
23(4)344,
25(1)126,
29(6)531,
31(6)490,
32(3)238
- 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)5,
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(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)5,
28(1)17,
28(5)524,
29(1)52,
29(2)161,
29(2)182,
30(5)433,
31(4)344,
32(3)194,
32(3)246
- routing,
25(1)87,
28(1)5,
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(1)5,
28(4)375,
29(2)109,
29(3)277,
30(2)189,
30(3)249,
30(4)328,
32(1)16
- schemes,
25(3)347,
25(4)478,
29(4)322,
31(3)209,
31(3)258,
32(3)238
- spanning,
28(2)184,
31(4)304
- table,
23(1)37,
23(2)188,
24(2)130,
24(4)383-1,
25(2)239,
25(3)347,
25(4)448,
25(4)478,
25(4)486,
27(3)225,
27(3)230,
28(1)54,
28(1)68,
28(3)313,
28(4)366,
28(4)412,
29(5)430,
31(4)296,
31(6)481
- using,
23(1)41,
23(2)142,
23(4)380,
23(4)381,
24(2)118,
24(3)263,
24(3)271,
24(4)295,
24(4)324,
25(1)63,
25(1)84,
26(2)113,
26(4)344,
28(2)112,
28(4)409,
28(4)414,
29(2)118,
29(2)176,
29(2)182,
29(3)201,
29(5)423,
29(6)564,
30(1)87,
30(2)176,
30(4)343,
30(5)437,
30(6)541,
31(3)201,
31(3)269,
31(4)289,
31(6)525,
31(6)567,
31(6)570,
32(2)142,
32(3)273,
32(4)341,
32(5)470