A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:00, 7 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
