Algorithms – ESA 2004

DOI10.1007/B100428zbMath1111.68457OpenAlexW2483610301MaRDI QIDQ5464574

Ashish Goel, Douglas E. Carroll

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Pathwidth, trees, and random embeddings ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Randomly removing \(g\) handles at once

This page was built for publication: Algorithms – ESA 2004