An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56210441, #quickstatements; #temporary_batch_1711234560214 |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-006-9039-7 / rank | |||
| Property / cites work | |||
| Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5687247 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3145799 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5687249 / 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: Q4411385 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for the maximum clique problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5687246 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding a Maximum Independent Set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum clique problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for maximum independent sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Target-oriented branch and bound method for global optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4452109 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for finding a maximum clique in a graph / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-006-9039-7 / rank | |||
Normal rank | |||
Latest revision as of 06:11, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |
scientific article |
Statements
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (English)
0 references
6 March 2007
0 references
Maximum clique
0 references
Algorithm
0 references
Branch-and-bound
0 references
Approximate coloring
0 references
Computational experiments
0 references
0 references
