Relaxed approximate coloring in exact maximum clique search (Q2257362): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2013.10.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170659335 / 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: Q4452109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for maximum clique: a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact bit-parallel algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bit parallel exact maximum clique algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to MCS algorithm for the maximum clique problem / rank
 
Normal rank

Latest revision as of 18:24, 9 July 2024

scientific article
Language Label Description Also known as
English
Relaxed approximate coloring in exact maximum clique search
scientific article

    Statements

    Relaxed approximate coloring in exact maximum clique search (English)
    0 references
    0 references
    0 references
    25 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    approximate coloring
    0 references
    branch-and-bound
    0 references
    global search
    0 references
    0 references