Group-theoretic algorithms and graph isomorphism
From MaRDI portal
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)
Cited in
(52)- Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
- Computing in general Abelian groups is hard
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
- On the computational complexity of the Abelian permutation group structure, membership and intersection problems
- Intersecting subgroups of finite soluble groups
- Parallel algorithms for solvable permutation groups
- Graph isomorphism is in the low hierarchy
- Strong tree-cographs are Birkhoff graphs
- Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Graph isomorphism is low for PP
- Asymptotic results for primitive permutation groups
- Solvable black-box group problems are low for PP
- Learnability of quantified formulas.
- The counting complexity of group-definable languages
- A novel approach to perturbative calculations for a large class of interacting boson theories
- A graph isomorphism algorithm using pseudoinverses
- Efficient algorithmic learning of the structure of permutation groups by examples
- Graph isomorphism and identification matrices: Sequential algorithms
- A new approach to operating with undirected trees
- The complexity of homomorphism factorization
- Vulnerability analysis of multiprocessor system based on burnt pancake networks
- Neighbor-connectivity of pancake networks and burnt pancake networks
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
- Target set selection on generalized pancake graphs
- Parallel rewriting of attributed graphs
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- Symmetric ILP: Coloring and small integers
- Graph Isomorphism is in SPP
- Generic case complexity of the graph isomorphism problem
- Quantum algorithms for algebraic problems
- The Isomorphism Problem for k-Trees Is Complete for Logspace
- A Logspace Algorithm for Partial 2-Tree Canonization
- An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
- Restrictive Acceptance Suffices for Equivalence Problems
- Exploring the tractability border in epistemic tasks
- Graph isomorphism is low for PP
- scientific article; zbMATH DE number 7092005 (Why is no real title available?)
- Neighborhood hypergraphs of bipartite graphs
- Reductions to Graph Isomorphism
- Linear and sublinear time algorithms for the basis of abelian groups
- A nonadaptive NC checker for permutation group intersection
- Fast computation of the centralizer of a permutation group in the symmetric group
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- The isomorphism problem for \(k\)-trees is complete for logspace
- Efficient comparison of program slices
- Permutative rewriting and unification
- A proof of Holt's algorithm
- Reductions to graph isomorphism
- Hashing and canonicalizing Notation 3 graphs
This page was built for publication: Group-theoretic algorithms and graph isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165581)