A fast parallel algorithm for finding Hamiltonian cycles in dense graphs

Sárközy, Gábor (2009) A fast parallel algorithm for finding Hamiltonian cycles in dense graphs. Discrete Mathematics, 309. pp. 1611-1622.

Full text not available from this repository.
Item Type: ISI Article
Uncontrolled Keywords: Hamilton cycle, Regularity Lemma
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 16:05
Last Modified: 11 Dec 2012 16:05
URI: http://eprints.sztaki.hu/id/eprint/5973

Update Item Update Item