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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MaxCliqueDyn / 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.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 17:24, 9 July 2024

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

    Statements

    Identifiers