Pages that link to "Item:Q4899245"
From MaRDI portal
The following pages link to A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs (Q4899245):
Displaying 8 items.
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← 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)
- New results on planar and directed multicuts (Q2851464) (← links)
- (Q3212283) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)