Pages that link to "Item:Q4327819"
From MaRDI portal
The following pages link to An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (Q4327819):
Displaying 3 items.
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- A space-efficient parameterized algorithm for the Hamiltonian Cycle problem by dynamic algebraization (Q2330550) (← links)
- Directed hamiltonian packing in d-dimensional meshes and its application (Q6487449) (← links)