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):
Displaying 9 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)
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
