Pages that link to "Item:Q4210152"
From MaRDI portal
The following pages link to Separator-Based Sparsification II: Edge and Vertex Connectivity (Q4210152):
Displaying 11 items.
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Separator based sparsification. I: Planarity testing and minimum spanning trees (Q1915501) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
- Sparsification—a technique for speeding up dynamic graph algorithms (Q4377592) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- Synchronized Planarity with Applications to Constrained Planarity Problems (Q6075858) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)