On the Complexity of Canonical Labeling of Strongly Regular Graphs

Cited in

(51)

Graph isomorphism problem
Concerning the complexity of deciding isomorphism of block designs
An optimal lower bound on the number of variables for graph identification
A graph isomorphism algorithm for object recognition
On computation complexity problems concerning relation algebras
Identification of points using disks
Quantum algorithm design: techniques and applications
On the metric dimension of incidence graphs
Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
On the metric dimension of the folded \(n\)-cube
Distance-regular graphs without 4-claws
Locating-dominating sets and identifying codes in graphs of girth at least 5
Partition dimension of projective planes
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
List-distinguishing Cartesian products of cliques
Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
Asymptotic Delsarte cliques in distance-regular graphs
The difference between the metric dimension and the determining number of a graph
The determining number of a Cartesian product
On the automorphism groups of strongly regular graphs. II.
Star partitions and the graph isomorphism problem
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
On the metric dimension of imprimitive distance-regular graphs
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
Graph theory (algorithmic, algebraic, and metric problems)
The metric dimension of the lexicographic product of graphs
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
On the complexity of identifying strongly regular graphs
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
New bounds and constructions for neighbor-locating colorings of graphs
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Faster isomorphism for p-groups of class 2 and exponent p
On locating and neighbor-locating colorings of sparse graphs
Progress towards the two-thirds conjecture on locating-total dominating sets
An algorithm to recover shredded random matrices
On the metric dimension of the character degree graph of a solvable group
Identifying codes in graphs of given maximum degree: characterizing trees
On the constant-depth circuit complexity of generating quasigroups
Discriminating code and set cover with k-bend paths
On open-separating dominating codes in graphs
Average-case and smoothed analysis of graph isomorphism
Bounding the Weisfeiler-Leman dimension via a depth analysis of I/R-trees
Open-separating dominating codes in graphs
Constant depth circuit complexity for generating quasigroups
Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
Identifying codes in triangle-free graphs of bounded maximum degree
On a class of graphs with equal identifying code number and independence number
On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
A nonfactorial algorithm for testing isomorphism of two graphs
Identifying codes in vertex-transitive graphs and strongly regular graphs
Determining sets, resolving sets, and the exchange property

This page was built for publication: On the Complexity of Canonical Labeling of Strongly Regular Graphs

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