Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Varman:1988:EPA,
author = "Peter Varman and Kshitij Doshi",
title = "An efficient parallel algorithm for updating minimum
spanning trees",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "379--397",
month = jun,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Rice Univ",
affiliationaddress = "Houston, TX, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C5320G
(Semiconductor storage)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Electr. and Comput. Eng., George R. Brown
Sch. of Eng., Rice Univ., Houston, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Computer Programming; Concurrent Read
Exclusive Write; concurrent-read-exclusive-write
parallel random access machine; graph theory;
Mathematical Techniques--Trees; Minimum Spanning Trees;
n-vertex graph; parallel algorithm; Parallel
Algorithms; parallel algorithms; Parallel Random Access
Machines (prams); random-access storage; Tree Updates;
trees (mathematics); updating minimum spanning trees",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}