A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:12, 6 March 2024
scientific article; zbMATH DE number 4182825
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for recognizing bounded cutwidth in hypergraphs |
scientific article; zbMATH DE number 4182825 |
Statements
A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (English)
0 references
1991
0 references
cutwidth
0 references
polynomial algorithm
0 references
NP-complete
0 references
