A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
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 |
Revision as of 22:12, 19 March 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
5 October 2021
0 references
heuristics
0 references
search
0 references