Pages that link to "Item:Q2872101"
From MaRDI portal
The following pages link to Myhill-Nerode Methods for Hypergraphs (Q2872101):
Displaying 7 items.
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Tree-Related Widths of Graphs and Hypergraphs (Q3614197) (← links)
- (Q5963378) (redirect page) (← links)
