Optimal parallel verification of minimum spanning trees in logarithmic time

Brandon Dixon, Robert Endre Tarjan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations
Original languageEnglish (US)
Title of host publicationParallel and Distributed Computing
Subtitle of host publicationTheory and Practice - 1st Canada-France Conference, Proceedings
EditorsJoseph Peters, Michel Cosnard, Afonso Ferreira
PublisherSpringer Verlag
Pages13-22
Number of pages10
ISBN (Print)9783540580782
StatePublished - Jan 1 1994
Externally publishedYes
Event1st Canada-France Conference on Parallel and Distributed Computing, 1994 - Montreal, Canada
Duration: May 19 1994May 21 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume805 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st Canada-France Conference on Parallel and Distributed Computing, 1994
CountryCanada
CityMontreal
Period5/19/945/21/94

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimal parallel verification of minimum spanning trees in logarithmic time'. Together they form a unique fingerprint.

  • Cite this

    Dixon, B., & Tarjan, R. E. (1994). Optimal parallel verification of minimum spanning trees in logarithmic time. In J. Peters, M. Cosnard, & A. Ferreira (Eds.), Parallel and Distributed Computing: Theory and Practice - 1st Canada-France Conference, Proceedings (pp. 13-22). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 805 LNCS). Springer Verlag.