Pages that link to "Item:Q5425437"
From MaRDI portal
The following pages link to On the Treewidth and Pathwidth of Biconvex Bipartite Graphs (Q5425437):
Displayed 4 items.
- Edge search number of cographs (Q415273) (← links)
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)