Fast Algorithms for Pseudoarboricity
From MaRDI portal
Publication:5232551
DOI10.1137/1.9781611974317.10zbMath1429.68180OpenAlexW2296110048MaRDI QIDQ5232551
Publication date: 12 September 2019
Published in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974317.10
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: Fast Algorithms for Pseudoarboricity
