On the Complexity of Canonical Labeling of Strongly Regular Graphs
From MaRDI portal
Publication:3891778
DOI10.1137/0209018zbMath0446.68052OpenAlexW2101451020MaRDI QIDQ3891778
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209018
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (35)
On computation complexity problems concerning relation algebras ⋮ Identification of points using disks ⋮ Asymptotic Delsarte cliques in distance-regular graphs ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Partition dimension of projective planes ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters ⋮ Star partitions and the graph isomorphism problem ⋮ List-distinguishing Cartesian products of cliques ⋮ New bounds and constructions for neighbor-locating colorings of graphs ⋮ Concerning the complexity of deciding isomorphism of block designs ⋮ Unnamed Item ⋮ On the automorphism groups of strongly regular graphs. II. ⋮ Quantum algorithm design: techniques and applications ⋮ The metric dimension of the lexicographic product of graphs ⋮ On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs ⋮ On the metric dimension of incidence graphs ⋮ On the metric dimension of imprimitive distance-regular graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. ⋮ An optimal lower bound on the number of variables for graph identification ⋮ Determining sets, resolving sets, and the exchange property ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ On the metric dimension of the folded \(n\)-cube ⋮ The determining number of a Cartesian product ⋮ A graph isomorphism algorithm for object recognition ⋮ Distance-regular graphs without 4-claws ⋮ Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs ⋮ 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 ⋮ Graph isomorphism problem ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5
This page was built for publication: On the Complexity of Canonical Labeling of Strongly Regular Graphs
