Pages that link to "Item:Q5748885"
From MaRDI portal
The following pages link to A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885):
Displaying 5 items.
- Cutwidth of triangular grids (Q397153) (← links)
- Algorithms for the determination of cutsets in a hypergraph (Q805260) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- (Q4607983) (← links)