Finding maximum subgraphs with relatively large vertex connectivity (Q297249)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximum subgraphs with relatively large vertex connectivity |
scientific article |
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
