Degree-3 Treewidth Sparsifiers

Chandra Chekuri, Julia Chuzhoy

Type: Preprint

Publication Date: 2014-10-04

Citations: 0

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Degree-3 Treewidth Sparsifiers	2014	Chandra Chekuri Julia Chuzhoy
+	Degree-3 treewidth sparsifiers	2015	Chandra Chekuri Julia Chuzhoy
+ PDF Chat	Degree-3 Treewidth Sparsifiers	2014	Chandra Chekuri Julia Chuzhoy
+	Improved Guarantees for Vertex Sparsification in Planar Graphs	2017	Gramoz Goranci Monika Henzinger Pan Peng
+ PDF Chat	Improved Guarantees for Vertex Sparsification in Planar Graphs	2020	Gramoz Goranci Monika Henzinger Pan Peng
+ PDF Chat	Vertex Sparsification in Trees	2017	Gramoz Goranci Harald Räcke
+	Vertex Sparsification in Trees	2016	Gramoz Goranci Harald Raecke
+	Refined Vertex Sparsifiers of Planar Graphs	2017	Robert Krauthgamer Havana rika
+ PDF Chat	Refined Vertex Sparsifiers of Planar Graphs	2020	Robert Krauthgamer Havana Rika
+	On Sparsification for Computing Treewidth	2013	Bart M. P. Jansen
+	On Sparsification for Computing Treewidth	2013	Bart M. P. Jansen
+ PDF Chat	Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs	2024	Yu Chen Zihan Tan
+	Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs	2020	Zhiyang He Jason Li Magnus Wahlström
+	Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs	2022	Itai Boneh Robert Krauthgamer
+	Vertex Sparsifiers and Abstract Rounding Algorithms	2010	Moses Charikar Tom Leighton Shi Li Ankur Moitra
+	Vertex Sparsifiers and Abstract Rounding Algorithms	2010	Moses Charikar Tom Leighton Shi Li Ankur Moitra
+ PDF Chat	Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions	2013	Eun Jung Kim Alexander Langer Christophe Paul Felix Reidl Peter Rossmanith Ignasi Sau Somnath Sikdar
+ PDF Chat	A General Framework for Graph Sparsification	2019	Wai-Shing Fung Ramesh Hariharan Nicholas J. A. Harvey Debmalya Panigrahi
+	New Notions and Constructions of Sparsification for Graphs and Hypergraphs	2019	Nikhil Bansal Ola Svensson Luca Trevisan
+ PDF Chat	Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	2022	Marin Bougeret Bart M. P. Jansen Ignasi Sau

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (13)

Action	Title	Year	Authors
+ PDF Chat	Representative Sets and Irrelevant Vertices: New Tools for Kernelization	2012	Stefan Kratsch Magnus Wahlström
+ PDF Chat	Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability	2010	Konstantin Makarychev Yury Makarychev
+	Graph minors XXIII. Nash-Williams' immersion conjecture	2009	Neil Robertson Paul Seymour
+	Polynomial Bounds for the Grid-Minor Theorem	2013	Chandra Chekuri Julia Chuzhoy
+ PDF Chat	Spectral sparsification of graphs	2013	Joshua Batson Daniel A. Spielman Nikhil Srivastava Shang‐Hua Teng
+ PDF Chat	Vertex Sparsifiers: New Results from Old Techniques	2010	Matthias Englert Anupam Gupta Robert Krauthgamer Harald Räcke Inbal Talgam-Cohen Kunal Talwar
+ PDF Chat	Vertex Sparsifiers and Abstract Rounding Algorithms	2010	Moses Charikar Tom Leighton Shi Li Ankur Moitra
+ PDF Chat	On mimicking networks representing minimum terminal cuts	2014	Arindam Khan Prasad Raghavendra
+ PDF Chat	Routing in undirected graphs with constant congestion	2012	Julia Chuzhoy
+ PDF Chat	On vertex sparsifiers with Steiner nodes	2012	Julia Chuzhoy