Novel techniques to speed up the computation of the automorphism group of a graph
DOI10.1155/2014/934637zbMath1442.05135OpenAlexW2096704006WikidataQ59054358 ScholiaQ59054358MaRDI QIDQ2336847
Antonio Fernández Anta, José Luis López-Presa, Luis F. Chiroque
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/934637
Analysis of algorithms and problem complexity (68Q25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved random graph isomorphism
- Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
- PSL(2,q) as a collineation group of projective planes of small order
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- Practical graph isomorphism. II.
- Conflict Anticipation in the Search for Graph Automorphisms
- Conflict Propagation and Component Recursion for Canonical Labeling
- A large database of graphs and its use for benchmarking graph isomorphism algorithms
- Symmetry and Satisfiability: An Update
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
This page was built for publication: Novel techniques to speed up the computation of the automorphism group of a graph
