Pages that link to "Item:Q1026166"
From MaRDI portal
The following pages link to A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166):
Displaying 7 items.
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- Efficient algorithms for \(k\)-terminal cuts on planar graphs (Q1889599) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs (Q4899245) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- (Q5743427) (← links)