An exact algorithm for the maximum clique problem (Q922964): 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 a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the independent set 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: Q3793964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique detection for nondirected graphs: Two new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the number of internal stability of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of graphs / rank
 
Normal rank

Revision as of 11:00, 21 June 2024

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

    Statements

    Identifiers

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