Polynomial bounds for the grid-minor theorem
From MaRDI portal
Publication:5259539
DOI10.1145/2591796.2591813zbMath1315.05131arXiv1305.6577OpenAlexW2152982698MaRDI QIDQ5259539
Julia Chuzhoy, Chandra Chekuri
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.6577
Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (27)
A polynomial excluded-minor approximation of treedepth ⋮ An edge variant of the Erdős-Pósa property ⋮ Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Obstructions to a small hyperbolicity in Helly graphs ⋮ Uniform Kernelization Complexity of Hitting Forbidden Minors ⋮ Towards the Graph Minor Theorems for Directed Graphs ⋮ Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ Coloring immersion-free graphs ⋮ Minors in graphs of large \(\theta_r\)-girth ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Sparse obstructions for minor-covering parameters ⋮ Grid minors in damaged grids ⋮ The all-or-nothing flow problem in directed graphs with symmetric demand pairs ⋮ Low Polynomial Exclusion of Planar Graph Patterns ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ On the Block Number of Graphs ⋮ Explicit linear kernels for packing problems ⋮ On first-order definitions of subgraph isomorphism properties ⋮ The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs ⋮ On the $AC^0$ Complexity of Subgraph Isomorphism ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ The descriptive complexity of subgraph isomorphism without numerics ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ Bidimensionality and Kernels ⋮ Tree decompositions and social graphs ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: Polynomial bounds for the grid-minor theorem
