Embedding and canonizing graphs of bounded genus in logspace

DOI10.1145/2591796.2591865zbMath1315.68254OpenAlexW1985953373MaRDI QIDQ5259572

Ken-ichi Kawarabayashi, Michael Elberfeld

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

zbMATH Keywords

computational complexityisomorphismgraph embeddingalgorithmic graph theorylogspaceEuler genus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph designs and isomorphic decomposition (05C51)

Related Items (10)

Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Depth-First Search Using $$O(n)$$ Bits ⋮ Space-efficient algorithms for reachability in directed geometric graphs ⋮ On the Parameterized Parallel Complexity and the Vertex Cover Problem ⋮ Space efficient algorithm for solving reachability using tree decomposition and separators ⋮ Sublinear-space approximation algorithms for Max \(r\)-SAT ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Approximation in (Poly-) logarithmic space ⋮ Approximation in (Poly-) Logarithmic Space

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: Embedding and canonizing graphs of bounded genus in logspace