Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2021.100646 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / 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.disopt.2021.100646 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3162614331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting codes over an alphabet of four elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parllel algorithm for finding a maximum weight clique of an interval 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: Approximating the maximum vertex/edge weighted clique using local search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2021.100646 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:49, 17 December 2024

scientific article
Language Label Description Also known as
English
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
scientific article

    Statements

    Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2021
    0 references
    maximum weight clique
    0 references
    exact algorithm
    0 references
    branch-and-bound
    0 references
    parallel algorithm
    0 references
    NP-hard
    0 references
    0 references
    0 references

    Identifiers