An efficient nc algorithm for finding hamiltonian cycles in dense directed graphs

Martin Fürer, Balaji Raghavachari

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

    2 Scopus citations

    Abstract

    Let G be a directed graph with n vertices such that whenever there is no arc from any vertex u to another vertex υ, then the sum of the outdegree of u and the indegree of ν is at least n. It is known that such a graph G always contains a Hamiltonian cycle. We show that such a cycle can be computed with a linear number of processors in O(log3 n) time on a CREW PRAM.

    Original languageEnglish (US)
    Title of host publicationAutomata, Languages and Programming - 18th International Colloquium, Proceedings
    EditorsJavier Leach Albert, Mario Rodriguez Artalejo, Burkhard Monien
    PublisherSpringer Verlag
    Pages429-440
    Number of pages12
    ISBN (Print)9783540542339
    DOIs
    StatePublished - Jan 1 1991
    Event18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 - Madrid, Spain
    Duration: Jul 8 1991Jul 12 1991

    Publication series

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

    Other

    Other18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991
    CountrySpain
    CityMadrid
    Period7/8/917/12/91

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'An efficient nc algorithm for finding hamiltonian cycles in dense directed graphs'. Together they form a unique fingerprint.

  • Cite this

    Fürer, M., & Raghavachari, B. (1991). An efficient nc algorithm for finding hamiltonian cycles in dense directed graphs. In J. L. Albert, M. R. Artalejo, & B. Monien (Eds.), Automata, Languages and Programming - 18th International Colloquium, Proceedings (pp. 429-440). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 510 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54233-7_153