default search action

combined dblp search
author search
venue search
publication search

ask others

"A fast parallel algorithm for finding Hamiltonian cycles in dense graphs."

Gábor N. Sárközy (2009)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2008.02.041

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Sarkozy09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Sarkozy09
Gábor N. Sárközy:
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs. Discret. Math. 309(6): 1611-1622 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.