Pages that link to "Item:Q437685"
From MaRDI portal
The following pages link to Computing hypergraph width measures exactly (Q437685):
Displaying 8 items.
- Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs (Q1929213) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Tree-Related Widths of Graphs and Hypergraphs (Q3614197) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- HyperBench (Q5102056) (← links)
- (Q6089669) (← links)