Pages that link to "Item:Q2686128"
From MaRDI portal
The following pages link to Computing partial hypergraphs of bounded width (Q2686128):
Displaying 5 items.
- Computing hypergraph width measures exactly (Q437685) (← links)
- The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications (Q678869) (← links)
- Decomposition of a hypergraph by partial-edge separators (Q1566705) (← links)
- Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs (Q1929213) (← links)
- Computability of width of submodular partition functions (Q1933647) (← links)