A fast algorithm for the maximum weight clique problem (Q1316588): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Finding maximum cliques in arbitrary and in special graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A node covering algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of 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: TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the maximum internally stable set in a weighted graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum weighted independent set in an arbitrary graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02243394 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W9324657 / rank
 
Normal rank

Latest revision as of 09:46, 30 July 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for the maximum weight clique problem
scientific article

    Statements

    A fast algorithm for the maximum weight clique problem (English)
    0 references
    0 references
    0 references
    14 March 1994
    0 references
    maximum clique finding
    0 references
    weighted problem
    0 references
    exact algorithm
    0 references
    integer linear program
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references