### 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 |

### 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