Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043): 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.1007/s10878-021-00736-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3156386224 / rank | |||
Normal rank | |||
Revision as of 23:26, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Declawing a graph: polyhedra and branch-and-cut algorithms |
scientific article |
Statements
Declawing a graph: polyhedra and branch-and-cut algorithms (English)
0 references
11 August 2021
0 references
graph declawing problem
0 references
claw-free graphs
0 references
branch-and-cut
0 references
polyhedral combinatorics
0 references
