Restricted space algorithms for isomorphism on bounded treewidth graphs
type: Item
instance of: scholarly article
title: Restricted space algorithms for isomorphism on bounded treewidth graphs
zbMATH Open document ID: 1251.05167
author: Bireswar Das
author: Fabian Wagner
author: Jacobo Torán
published in: Information and Computation
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6092981
zbMATH Keywords: complexity
zbMATH Keywords: algorithms
zbMATH Keywords: graph isomorphism problem
zbMATH Keywords: treewidth
zbMATH Keywords: logCFL
MaRDI profile type: Publication
full work available at URL: j.ic.2012.05.003
OpenAlex ID: W2129003155
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space
cites work: Computing LOGCFL certificates
cites work: Testing Graph Isomorphism in Parallel by Playing a Game
cites work: Completeness results for graph isomorphism.
cites work: The Isomorphism Problem for k-Trees Is Complete for Logspace
cites work: Q4273947
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Undirected connectivity in log-space
cites work: Q4142695
cites work: Bounded Tree-Width and LOGCFL
cites work: Isomorphism for graphs of bounded distance width
DOI: 10.1016/J.IC.2012.05.003
description: scientific article; zbMATH DE number 6092981