Pages that link to "Item:Q3586387"
From MaRDI portal
The following pages link to Shortest Cut Graph of a Surface with Prescribed Vertex Set (Q3586387):
Displaying 6 items.
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
