The parallel complexity of graph canonization under abelian group action
type: Item
instance of: scholarly article
title: The parallel complexity of graph canonization under abelian group action
zbMATH Open document ID: 1277.68082
author: Vikraman Arvind
author: Johannes Köbler
published in: Algorithmica
publication date: 2013-11-11T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6225268
zbMATH Keywords: graph isomorphism
zbMATH Keywords: logspace counting classes
zbMATH Keywords: parallel complexity
MaRDI profile type: Publication
full work available at URL: s00453-013-9805-0
OpenAlex ID: W2089433923
cites work: Q5465356
cites work: Relationships among $PL$, $\#L$, and the determinant
cites work: The complexity of matrix rank and feasible systems of linear equations
cites work: On Hypergraph and Graph Isomorphism with Bounded Color Classes
cites work: STACS 2005
cites work: Isomorphism and canonization of tournaments and hypertournaments
cites work: Structure and importance of logspace-MOD class
cites work: Q4364501
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Q3912839
cites work: Completeness results for graph isomorphism.
cites work: Q4273947
cites work: Q4273608
cites work: Parallel algorithms for solvable permutation groups
cites work: The Parallel Complexity of Abelian Permutation Group Problems
cites work: Parallel Tree Contraction Part 2: Further Applications
cites work: Undirected ST-connectivity in log-space
cites work: On the Hardness of Graph Isomorphism
cites work: Q5512231
DOI: 10.1007/S00453-013-9805-0
description: scientific article; zbMATH DE number 6225268