Pages that link to "Item:Q944745"
From MaRDI portal
The following pages link to On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745):
Displayed 4 items.
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)