An exact bit-parallel algorithm for the maximum clique problem (Q709206): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for 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
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution towards the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Characterizations of the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region technique for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035310 / rank
 
Normal rank

Revision as of 07:57, 3 July 2024

scientific article
Language Label Description Also known as
English
An exact bit-parallel algorithm for the maximum clique problem
scientific article

    Statements

    An exact bit-parallel algorithm for the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    15 October 2010
    0 references
    maximum clique
    0 references
    bit string
    0 references
    branch and bound
    0 references
    coloring
    0 references
    bit-parallelism
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers