A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59409802, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1407.7061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anomalies in parallel branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-threading a state-of-the-art maximum clique algorithm / 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 efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / 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: An exact bit-parallel 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: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank

Latest revision as of 13:44, 10 July 2024

scientific article
Language Label Description Also known as
English
A parallel branch and bound algorithm for the maximum labelled clique problem
scientific article

    Statements

    A parallel branch and bound algorithm for the maximum labelled clique problem (English)
    0 references
    0 references
    0 references
    22 July 2015
    0 references
    maximum labelled clique
    0 references
    parallel branch and bound
    0 references
    combinatorial optimisation
    0 references
    computational experiments
    0 references

    Identifiers