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

Martin Furer, Balaji Raghavachari

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'An efficient parallel algorithm for finding hamiltonian cycles in dense directed graphs'. Together they form a unique fingerprint.

Mathematics