Pages that link to "Item:Q1274324"
From MaRDI portal
The following pages link to Efficient Union-Find for planar graphs and other sparse graph classes (Q1274324):
Displaying 6 items.
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Efficient region segmentation on compressed gray images using quadtree and shading representation (Q1764075) (← links)
- The longest common substring problem (Q2971067) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
