A note on the graph isomorphism counting problem

Cites work

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

Cited in

(67)

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

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)