An algorithm for finding a maximum clique in a graph (Q1267190): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
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 fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring / 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: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring / 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: Q3035310 / 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: Algorithm 457: finding all cliques of an undirected 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / 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: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(97)00054-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002747011 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for finding a maximum clique in a graph
scientific article

    Statements

    An algorithm for finding a maximum clique in a graph (English)
    0 references
    0 references
    6 October 1998
    0 references
    graph algorithm
    0 references
    maximum clique problem
    0 references
    branch-and-bound algorithm
    0 references
    vertex coloring
    0 references
    fractional coloring
    0 references
    0 references
    0 references

    Identifiers