Exact algorithms for the vertex separator problem in graphs (Q3008917)
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: Exact algorithms for the vertex separator problem in graphs |
scientific article; zbMATH DE number 5911727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the vertex separator problem in graphs |
scientific article; zbMATH DE number 5911727 |
Statements
Exact algorithms for the vertex separator problem in graphs (English)
0 references
22 June 2011
0 references
Lagrangian relaxation
0 references
cutting planes
0 references
integer programming
0 references
relax-and-cut
0 references
vertex separator problem
0 references
0 references
0.9765337
0 references
0 references
0.9163635
0 references
0.9150552
0 references
0.9035492
0 references
0.90021527
0 references
0.89884955
0 references
0 references
