A note on the graph isomorphism counting problem

Cites work

scientific article; zbMATH DE number 3557226 (Why is no real title available?)
scientific article; zbMATH DE number 3299758 (Why is no real title available?)
Finding nearest neighbours
Location of a Point in a Planar Subdivision and Its Applications
Multidimensional Searching Problems
The complexity of finding fixed-radius near neighbors

Cited in

(60)

On the complexity of the hidden subgroup problem
Generalizations of k-dimensional Weisfeiler-Leman stabilization
Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
Pseudo-deterministic proofs
On the reducibility of sets inside NP to sets with low information content
On the asymmetric complexity of the group-intersection problem
On computation complexity problems concerning relation algebras
Graph algebras and the graph isomorphism problem
Comparison of Atom Maps
On multidimensional Schur rings of finite groups
The QAP-polytope and the graph isomorphism problem
On the uniform random generation of non deterministic automata up to isomorphism
Configuring random graph models with fixed degree sequences
Symmetry breaking constraints for the minimum deficiency problem
Graph theory (algorithmic, algebraic, and metric problems)
On the Complexity of the Hidden Subgroup Problem
Two-closure of rank \(3\) groups in polynomial time
Parameterized counting of partially injective homomorphisms
Computing functions with parallel queries to NP
The counting complexity of group-definable languages
Generalized X-join of graphs and their automorphisms
On tail dependence matrices. The realization problem for parametric families
Computational complexity of computing symmetries in finite-domain planning
On the complexity of computational problems associated with simple stochastic games
An optimal lower bound on the number of variables for graph identification
New invariants for the graph isomorphism problem
Computational complexity of computing a partial solution for the graph automorphism problems
An improved isomorphism test for bounded-tree-width graphs
Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
On counting problems and the polynomial-time hierarchy
Isomorphism Testing Parameterized by Genus and Beyond
On the isomorphism of graphs having some eigenvalues of moderate multiplicity
The complexity of equivalence and isomorphism of systems of equations over finite groups
3-connected reduction for regular graph covers
Permutation Groups and the Graph Isomorphism Problem
Graph isomorphism restricted by lists
The complexity of Boolean matrix root computation
On a new high dimensional Weisfeiler-Lehman algorithm
On the complexity of identifying strongly regular graphs
On complete systems of invariants for small graphs
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Information theoretic measures of UHG graphs with low computational complexity
Choiceless polynomial time with witnessed symmetric choice
Faster algorithms for counting subgraphs in sparse graphs
Parameterized complexity of small weight automorphisms and isomorphisms
A short certificate of the number of universal optimal strategies for stopping simple stochastic games
Representing Groups on Graphs
Graph isomorphism problem and 2-closed permutation groups
Graph isomorphism is in the low hierarchy
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Graph isomorphism is low for PP
Graph isomorphism is low for PP
Detecting almost symmetries of graphs
Testing homotopy equivalence is isomorphism complete
Graph isomorphism problem
Drawing series parallel digraphs symmetrically
Graph Isomorphism is in SPP
Uniquely pressable graphs: characterization, enumeration, and recognition
Subcomplete generalizations of graph isomorphism
Count-free Weisfeiler-Leman and group isomorphism

This page was built for publication: A note on the graph isomorphism counting problem

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