A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4182825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.796230673789978
0 references
0.7765956521034241
0 references
0.770396888256073
0 references
