Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Canonizing Graphs of Bounded Tree Width in Logspace - MaRDI portal

Canonizing Graphs of Bounded Tree Width in Logspace

From MaRDI portal

Publication:4973889

Jump to:navigation, search

DOI10.1145/3132720zbMath1427.68238OpenAlexW1135667589MaRDI QIDQ4973889

Pascal Schweitzer, Michael Elberfeld

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5733/

zbMATH Keywords

computational complexity tree width algorithmic graph theory graph isomorphism logspace algorithms graph canonization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Computing Tree Decompositions

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4973889&oldid=19405642"