Last update: Sat Jan 6 02:03:49 MST 2018
@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",
}