Publication:1730234: Difference between revisions
From MaRDI portal
Publication:1730234
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs to Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs: Duplicate |
(No difference)
|
Latest revision as of 14:56, 2 May 2024
DOI10.1016/j.dam.2018.08.027zbMath1406.05102arXiv1407.6761MaRDI QIDQ1730234
Publication date: 11 March 2019
Published in: Discrete Applied Mathematics, Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.6761
68Q25: Analysis of algorithms and problem complexity
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms