Mimicking Networks and Succinct Representations of Terminal Cuts

DOI10.1137/1.9781611973105.128zbMath1423.68352arXiv1207.6246OpenAlexW2951159514MaRDI QIDQ5741838

Inbal Rika, Robert Krauthgamer

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.6246

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (8)

On mimicking networks representing minimum terminal cuts ⋮ Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm ⋮ Refined Vertex Sparsifiers of Planar Graphs ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An exponential lower bound for cut sparsifiers in planar graphs ⋮ NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs

This page was built for publication: Mimicking Networks and Succinct Representations of Terminal Cuts