scientific article; zbMATH DE number 176753

zbMATH Open0764.68049MaRDI QIDQ4036583FDOQ4036583

Authors: Balaji Raghavachari, Martin Fürer 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
• An algorithm for finding hamilton cycles in random directed graphs
• On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
• Finding Hamilton cycles in robustly expanding digraphs
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs

zbMATH Keywords

Hamiltonian cycledirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Distributed algorithms (68W15)

Cited In (7)

• A space-efficient parameterized algorithm for the Hamiltonian Cycle problem by dynamic algebraization
• An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
• On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
• An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
• A successful algorithm for solving directed Hamiltonian path problems
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036583)