Last update: Fri Jan 5 02:05:58 MST 2018
@Article{Cockburn:1989:TFR, author = "Alistair A. R. Cockburn", title = "Tree-forming Reversible Routes in Communication Networks", journal = j-COMP-NET-ISDN, volume = "16", number = "4", pages = "267--279", month = mar, 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/Theory/Seiferas/1989.bib; http://www.math.utah.edu/pub/tex/bib/compnetisdn.bib", acknowledgement = ack-nhfb, affiliation = "Zurich Research Lab", affiliationaddress = "R{\"u}schlikon, Switz", classification = "703; 716; 717; 718; 723; 921", journal-URL = "http://www.sciencedirect.com/science/journal/01697552", journalabr = "Comput Networks ISDN Syst", keywords = "Communication Networks; Computer Programming--Algorithms; Data Transmission--Theory; Electric Networks, Communication; Mathematical Techniques--Trees; Route Definition; Route Selection; Tree-Forming Reversible Routes", }