A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765): 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.1613/jair.1.12327 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3199242384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region technique for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards faster local search for minimum weight vertex cover on massive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5282985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-coloring of vertex-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complementary Pivoting Approach to the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phased local search 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 / cites work
 
Property / cites work: Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-bound algorithm for the maximum weighted clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact maximum clique algorithm for large and massive sparse graphs / 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 hybrid heuristic for the maximum clique problem / 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: 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
Property / cites work
 
Property / cites work: Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-neighborhood tabu search for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: PUSH: A generalized operator for the maximum vertex weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 19:23, 26 July 2024

scientific article; zbMATH DE number 7406493
Language Label Description Also known as
English
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
scientific article; zbMATH DE number 7406493

    Statements

    A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 October 2021
    0 references
    heuristics
    0 references
    search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers