Separator-Based Sparsification II: Edge and Vertex Connectivity
From MaRDI portal
Publication:4210152
DOI10.1137/S0097539794269072zbMath0914.68042OpenAlexW1997906261WikidataQ101437882 ScholiaQ101437882MaRDI QIDQ4210152
Thomas H. Spencer, Giuseppe F. Italiano, David Eppstein, Zvi Galil
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794269072
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items
Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ Sublinear separators, fragility and subexponential expansion ⋮ Fully dynamic representations of interval graphs ⋮ A fully dynamic graph algorithm for recognizing interval graphs ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Maintaining dynamic minimum spanning trees: an experimental study ⋮ Fully dynamic algorithm for recognition and modular decomposition of permutation graphs