A fast algorithm for the maximum clique problem (Q1613374): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding maximum cliques in arbitrary and in special graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test case generators and computational results for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary one-error-correcting codes of length 10 have 72 codewords / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum clique in a graph / rank
 
Normal rank

Revision as of 15:22, 4 June 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for the maximum clique problem
scientific article

    Statements

    A fast algorithm for the maximum clique problem (English)
    0 references
    29 August 2002
    0 references
    maximum independent set
    0 references
    maximum clique problem
    0 references
    branch-and-bound
    0 references
    random graphs
    0 references
    DIMACS benchmark graphs
    0 references

    Identifiers