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

Martin Furer, Balaji Raghavachari

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

    2 Citations (Scopus)

    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(log 3 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

    Fingerprint

    Hamiltonians
    Hamiltonian circuit
    Directed graphs
    Directed Graph
    Vertex of a graph
    Arc of a curve
    Cycle
    Graph in graph theory

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Furer, 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
    Furer, Martin ; Raghavachari, Balaji. / An efficient nc algorithm for finding hamiltonian cycles in dense directed graphs. Automata, Languages and Programming - 18th International Colloquium, Proceedings. editor / Javier Leach Albert ; Mario Rodriguez Artalejo ; Burkhard Monien. Springer Verlag, 1991. pp. 429-440 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{0137d645b22744919283777e69819839,
    title = "An efficient nc algorithm for finding hamiltonian cycles in dense directed graphs",
    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(log 3 n) time on a CREW PRAM.",
    author = "Martin Furer and Balaji Raghavachari",
    year = "1991",
    month = "1",
    day = "1",
    doi = "10.1007/3-540-54233-7_153",
    language = "English (US)",
    isbn = "9783540542339",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "429--440",
    editor = "Albert, {Javier Leach} and Artalejo, {Mario Rodriguez} and Burkhard Monien",
    booktitle = "Automata, Languages and Programming - 18th International Colloquium, Proceedings",
    address = "Germany",

    }

    Furer, M & Raghavachari, B 1991, An efficient nc algorithm for finding hamiltonian cycles in dense directed graphs. in JL Albert, MR Artalejo & B Monien (eds), Automata, Languages and Programming - 18th International Colloquium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 510 LNCS, Springer Verlag, pp. 429-440, 18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991, Madrid, Spain, 7/8/91. https://doi.org/10.1007/3-540-54233-7_153

    An efficient nc algorithm for finding hamiltonian cycles in dense directed graphs. / Furer, Martin; Raghavachari, Balaji.

    Automata, Languages and Programming - 18th International Colloquium, Proceedings. ed. / Javier Leach Albert; Mario Rodriguez Artalejo; Burkhard Monien. Springer Verlag, 1991. p. 429-440 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 510 LNCS).

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

    TY - GEN

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

    AU - Furer, Martin

    AU - Raghavachari, Balaji

    PY - 1991/1/1

    Y1 - 1991/1/1

    N2 - 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(log 3 n) time on a CREW PRAM.

    AB - 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(log 3 n) time on a CREW PRAM.

    UR - http://www.scopus.com/inward/record.url?scp=85027609084&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85027609084&partnerID=8YFLogxK

    U2 - 10.1007/3-540-54233-7_153

    DO - 10.1007/3-540-54233-7_153

    M3 - Conference contribution

    AN - SCOPUS:85027609084

    SN - 9783540542339

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 429

    EP - 440

    BT - Automata, Languages and Programming - 18th International Colloquium, Proceedings

    A2 - Albert, Javier Leach

    A2 - Artalejo, Mario Rodriguez

    A2 - Monien, Burkhard

    PB - Springer Verlag

    ER -

    Furer M, Raghavachari B. An efficient nc algorithm for finding hamiltonian cycles in dense directed graphs. In Albert JL, Artalejo MR, Monien B, editors, Automata, Languages and Programming - 18th International Colloquium, Proceedings. Springer Verlag. 1991. p. 429-440. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-54233-7_153