A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
type: Item
instance of: scholarly article
title: A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
zbMATH Open document ID: 1179.05107
author: Gábor N. Sárközy
published in: Discrete Mathematics
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 5565699
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: parallel algorithm
MaRDI profile type: Publication
full work available at URL: j.disc.2008.02.041
OpenAlex ID: W2091936180
cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem
cites work: The Algorithmic Aspects of the Regularity Lemma
cites work: Q3941433
cites work: Q3852212
cites work: A method in graph theory
cites work: On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
cites work: Some Theorems on Abstract Graphs
cites work: Parallel algorithms for finding Hamilton cycles in random graphs
cites work: Constructing a Maximal Independent Set in Parallel
cites work: Tripartite Ramsey numbers for paths
cites work: Q4385522
cites work: A fast parallel algorithm for the maximal independent set problem
cites work: Proof of a Packing Conjecture of Bollobás
cites work: On the square of a Hamiltonian cycle in dense graphs
cites work: Blow-up lemma
cites work: An algorithmic version of the blow-up lemma
cites work: Q4242960
cites work: Proof of the Seymour conjecture for large graphs
cites work: Proof of the Alon-Yuster conjecture
cites work: Q4736881
cites work: Q4878666
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: Tripartite version of the Corrádi-Hajnal theorem
cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
cites work: Hypergraph Packing and Graph Embedding
cites work: On the number of Hamiltonian cycles in Dirac graphs
cites work: Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
cites work: Q4200109
DOI: 10.1016/J.DISC.2008.02.041
description: scientific article; zbMATH DE number 5565699