Exact algorithms for the vertex separator problem in graphs (Q3008917): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/net.20420 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2139900483 / rank | |||
Normal rank |
Revision as of 20:37, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Exact algorithms for the vertex separator problem in graphs |
scientific article |
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