An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs

Given an edge-weighted graph G with a set Q of k terminals, a mimicking network is a graph with the same set of terminals that exactly preserves the size of minimum cut between any partition of the terminals. A natural question in the area of graph compression is to provide as small mimicking networ...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 81; no. 10; pp. 4029 - 4042
Main Authors:	Karpov, Nikolai, Pilipczuk, Marcin, Zych-Pawlewicz, Anna
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2019 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graphs Lower bounds Mathematics of Computing Special Issue: Parameterized and Exact Computation Terminals Theory of Computation Upper bounds Sparsifier Mimicking network Planar graph
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!