Topology-independent algorithms based on spanning trees

J.J. Lukkien, J.L.A. Snepscheut, van de

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    Abstract

    We consider a class of distributed algorithms. Algorithms in this class consist of processes that communicate using a broadcast. We show that local information suffices to implement such an algo rithm on an arbitrary network. We investigate the time complexity and present some experimental results.
    Original languageEnglish
    Title of host publicationBeauty is our business : a birthday salute to Edsger W. Dijkstra
    EditorsW.H.J. Feijen, A.J.M. Gasteren, van, D. Gries, J. Misra
    Place of PublicationBerlin
    PublisherSpringer
    Pages280-288
    ISBN (Print)0-387-97299-4
    Publication statusPublished - 1990

    Publication series

    NameTexts and monographs in computer science
    ISSN (Print)0172-603X

    Fingerprint

    Dive into the research topics of 'Topology-independent algorithms based on spanning trees'. Together they form a unique fingerprint.

    Cite this