Pages that link to "Item:Q2408168"
From MaRDI portal
The following pages link to Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168):
Displaying 9 items.
- 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)
- (Q3452801) (redirect page) (← links)
- Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs (Q4629967) (← links)
- Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (Q5056419) (← links)
- (Q5088957) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)