Publication:4962182: Difference between revisions
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor to A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor: Duplicate |
(No difference)
|
Latest revision as of 16:09, 2 May 2024
DOI10.1145/2629508zbMath1400.68158arXiv1302.3417OpenAlexW2444233166MaRDI QIDQ4962182
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms, Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3417
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items