An improved bit parallel exact maximum clique algorithm (Q1941191): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
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 / OpenAlex ID
 
Property / OpenAlex ID: W2008362324 / 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: 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: A fast algorithm for the maximum clique problem / 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: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / 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: Q5687246 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:04, 6 July 2024

scientific article
Language Label Description Also known as
English
An improved bit parallel exact maximum clique algorithm
scientific article

    Statements

    An improved bit parallel exact maximum clique algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 March 2013
    0 references
    0 references
    maximum clique
    0 references
    branch and bound
    0 references
    exact search
    0 references
    graph
    0 references
    0 references