A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.02.041 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.02.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091936180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for finding Hamilton cycles in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a Maximal Independent Set in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tripartite Ramsey numbers for paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a Packing Conjecture of Bollobás / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic version of the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tripartite version of the Corrádi-Hajnal theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Packing and Graph Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Hamiltonian cycles in Dirac graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2008.02.041 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:29, 10 December 2024

scientific article
Language Label Description Also known as
English
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
scientific article

    Statements

    A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (English)
    0 references
    17 June 2009
    0 references
    Hamiltonian cycle
    0 references
    parallel algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references