Canonizing Graphs of Bounded Tree Width in Logspace

DOI10.4230/LIPIcs.STACS.2016.32zbMath1388.68227arXiv1506.07810OpenAlexW2765834559MaRDI QIDQ4601884

Michael Elberfeld, Pascal Schweitzer

Publication date: 24 January 2018

Full work available at URL: https://arxiv.org/abs/1506.07810

zbMATH Keywords

computational complexitytree widthalgorithmic graph theorygraph isomorphismlogspace

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ An improved isomorphism test for bounded-tree-width graphs ⋮ A gentle introduction to applications of algorithmic metatheorems for space and circuit classes ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Unnamed Item ⋮ Graph isomorphism restricted by lists

This page was built for publication: Canonizing Graphs of Bounded Tree Width in Logspace