{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article10250","name":"Improved Guarantees for Vertex Sparsification in Planar Graphs","abstract":"Graph Sparsification aims at compressing large graphs into smaller ones while (approximately) preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. Given a weighted graph G=(V,E), and a terminal set K with |K|=k, a quality-q vertex cut sparsifier of G is a graph H with K contained in V_H that preserves the value of minimum cuts separating any bipartition of K, up to a factor of q. We show that planar graphs with all the k terminals lying on the same face admit quality-1 vertex cut sparsifier of size O(k^2) that are also planar. Our result extends to vertex flow and distance sparsifiers. It improves the previous best known bound of O(k^2 2^(2k)) for cut and flow sparsifiers by an exponential factor, and matches an Omega(k^2) lower-bound for this class of graphs. \r\n\r\nWe also study vertex reachability sparsifiers for directed graphs. Given a digraph G=(V,E) and a terminal set K, a vertex reachability sparsifier of G is a digraph H=(V_H,E_H), K contained in V_H that preserves all reachability information among terminal pairs. We introduce the notion of reachability-preserving minors, i.e., we require H to be a minor of G. Among others, for general planar digraphs, we construct reachability-preserving minors of size O(k^2 log^2 k). We complement our upper-bound by showing that there exists an infinite family of acyclic planar digraphs such that any reachability-preserving minor must have Omega(k^2) vertices.","keywords":["Vertex Sparsification","Graph Sparsification","Planar Graphs","Metric Embedding","Reachability"],"author":[{"@type":"Person","name":"Goranci, Gramoz","givenName":"Gramoz","familyName":"Goranci"},{"@type":"Person","name":"Henzinger, Monika","givenName":"Monika","familyName":"Henzinger"},{"@type":"Person","name":"Peng, Pan","givenName":"Pan","familyName":"Peng"}],"position":44,"pageStart":"44:1","pageEnd":"44:14","dateCreated":"2017-09-01","datePublished":"2017-09-01","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Goranci, Gramoz","givenName":"Gramoz","familyName":"Goranci"},{"@type":"Person","name":"Henzinger, Monika","givenName":"Monika","familyName":"Henzinger"},{"@type":"Person","name":"Peng, Pan","givenName":"Pan","familyName":"Peng"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.44","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6290","volumeNumber":87,"name":"25th Annual European Symposium on Algorithms (ESA 2017)","dateCreated":"2017-09-01","datePublished":"2017-09-01","editor":[{"@type":"Person","name":"Pruhs, Kirk","givenName":"Kirk","familyName":"Pruhs"},{"@type":"Person","name":"Sohler, Christian","givenName":"Christian","familyName":"Sohler"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article10250","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6290"}}}