Separating clique tree and bipartition inequalities in polynomial time (Q5101404): 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/3-540-59408-6_40 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1597374843 / rank | |||
Normal rank | |||
Revision as of 18:32, 19 March 2024
scientific article; zbMATH DE number 7577880
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating clique tree and bipartition inequalities in polynomial time |
scientific article; zbMATH DE number 7577880 |
Statements
Separating clique tree and bipartition inequalities in polynomial time (English)
0 references
30 August 2022
0 references
