### 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 language | English (US) |
---|---|

Title of host publication | Automata, Languages and Programming - 18th International Colloquium, Proceedings |

Editors | Javier Leach Albert, Mario Rodriguez Artalejo, Burkhard Monien |

Publisher | Springer Verlag |

Pages | 429-440 |

Number of pages | 12 |

ISBN (Print) | 9783540542339 |

DOIs | |

State | Published - Jan 1 1991 |

Event | 18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 - Madrid, Spain Duration: Jul 8 1991 → Jul 12 1991 |

### Publication series

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

Volume | 510 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 |
---|---|

Country | Spain |

City | Madrid |

Period | 7/8/91 → 7/12/91 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*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

}

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 -