A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q3404446): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_18 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1594785451 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:02, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique |
scientific article |
Statements
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (English)
0 references
9 February 2010
0 references