Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / 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: 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: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / 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: Q5670645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01955041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053867237 / rank
 
Normal rank

Latest revision as of 11:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
scientific article

    Statements

    Identifiers