An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem

DOI10.1145/2591796.2591876zbMath1315.05132OpenAlexW2081304472MaRDI QIDQ5259540

Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer

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://doi.org/10.1145/2591796.2591876

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph minors (05C83) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

Towards the Graph Minor Theorems for Directed Graphs ⋮ Constant Congestion Brambles in Directed Graphs ⋮ The power of cut-based parameters for computing edge-disjoint paths ⋮ Congestion-Free Rerouting of Flows on DAGs ⋮ The all-or-nothing flow problem in directed graphs with symmetric demand pairs ⋮ A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs ⋮ Half-integral linkages in highly connected directed graphs ⋮ On structural parameterizations of the edge disjoint paths problem ⋮ A relaxation of the directed disjoint paths problem: a global congestion metric helps ⋮ A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. ⋮ Unnamed Item ⋮ Digraphs of Bounded Width

Uses Software

• SuLQ

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: An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem