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...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 81; číslo 10; s. 4029 - 4042
Hlavní autoři:	Karpov, Nikolai, Pilipczuk, Marcin, Zych-Pawlewicz, Anna
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2019 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!