Targeted Branching for the Maximum Independent Set Problem (Q6159907)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Targeted Branching for the Maximum Independent Set Problem |
scientific article; zbMATH DE number 7700599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Targeted Branching for the Maximum Independent Set Problem |
scientific article; zbMATH DE number 7700599 |
Statements
23 June 2023
0 references
graphs
0 references
combinatorial optimization
0 references
independent set
0 references
vertex cover
0 references
clique
0 references
branch-and-reduce
0 references
branch-and-bound
0 references
data reduction
0 references
Targeted Branching for the Maximum Independent Set Problem (English)
0 references
0.87573534
0 references
0.8740514
0 references
0.86829257
0 references
0.86719966
0 references
0.8658988
0 references
0.8629149
0 references
0.8625393
0 references
0.8625393
0 references
