Pages that link to "Item:Q2851464"
From MaRDI portal
The following pages link to New results on planar and directed multicuts (Q2851464):
Displaying 6 items.
- The complexity of multicut and mixed multicut problems in (di)graphs (Q391767) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Revisiting a simple algorithm for the planar multiterminal cut problem (Q991478) (← links)
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width (Q2741506) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)