Pages that link to "Item:Q5936467"
From MaRDI portal
The following pages link to On approximation intractability of the path-distance-width problem (Q5936467):
Displaying 3 items.
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
