The connectivity carcass of a vertex subset in a graph and its incremental maintenance
From MaRDI portal
Publication:2817666
DOI10.1145/195058.195442zbMath1344.68058OpenAlexW2146747282MaRDI QIDQ2817666
Yefim Dinitz, A. D. Vaĭnshteĭn
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195442
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Data structures (68P05) Connectivity (05C40)
Related Items (3)
Spanning cactus: complexity and extensions ⋮ Output-sensitive reporting of disjoint paths (extended abstract) ⋮ Approximate spanning cactus
This page was built for publication: The connectivity carcass of a vertex subset in a graph and its incremental maintenance
