Pages that link to "Item:Q2097221"
From MaRDI portal
The following pages link to Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221):
Displaying 3 items.
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
- Efficient algorithms for minimal disjoint path problems on chordal graphs (Q4882587) (← links)