Finding maximum subgraphs with relatively large vertex connectivity (Q297249)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6598156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding maximum subgraphs with relatively large vertex connectivity |
scientific article; zbMATH DE number 6598156 |
Statements
Finding maximum subgraphs with relatively large vertex connectivity (English)
0 references
24 June 2016
0 references
vertex connectivity
0 references
clique relaxations
0 references
computational complexity
0 references
mixed integer programming
0 references
2-club
0 references
0 references
0 references
0 references
0.7672698497772217
0 references
0.7638121843338013
0 references
0.7553115487098694
0 references
0.750943660736084
0 references
