The complexity of modular graph automorphism

DOI10.1007/BFB0028559MaRDI QIDQ4381387zbMATH OpenFDO

Authors Vikraman Arvind, Richard Beigel, Antoni Lozano

Publication date 16 July 1998

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

Full work available at URL http://hdl.handle.net/2117/84914

zbMATH Keywords

graph automorphismgraph isomorphismIP protocol

Mathematics Subject Classification ID

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

Recommendations

• The complexity of modular graph automorphism
• Computational complexity of computing a partial solution for the graph automorphism problems
• Descriptive complexity of modularity problems on graphs
• LATIN 2004: Theoretical Informatics
• The parameterised complexity of computing the maximum modularity of a graph
• scientific article; zbMATH DE number 7378595
• Graph automorphisms of a finite modular lattice
• An algebraic analysis of the graph modularity
• Computing graph automorphism from partial solutions
• Automorphic decompositions of graphs

Cited in

(3)

• The complexity of modular graph automorphism
• scientific article; zbMATH DE number 7378595 (Why is no real title available?)
• A note on decision versus search for graph automorphism

This page was built for publication: The complexity of modular graph automorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381387)