An Algorithm for Generating Node Disjoint Routes in Kautz Digraphs

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    11 Citations (Scopus)
    Original languageUndefined
    Title of host publication5th Int. Parallel Processing Symp.
    EditorsV.K.P. Kumar
    Place of PublicationLos Alamitos, California
    PublisherIEEE Computer Society
    Pages102-107
    Number of pages6
    ISBN (Print)0-8186-9167-0
    Publication statusPublished - Apr 1991

    Keywords

    • CAES-PS: Pervasive Systems
    • EWI-1219
    • CAES-EEA: Efficient Embedded Architectures

    Cite this

    Smit, G. J. M., Havinga, P. J. M., & Jansen, P. G. (1991). An Algorithm for Generating Node Disjoint Routes in Kautz Digraphs. In V. K. P. Kumar (Ed.), 5th Int. Parallel Processing Symp. (pp. 102-107). Los Alamitos, California: IEEE Computer Society.