Random Graph Isomorphism

From MaRDI portal
Revision as of 20:20, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3901544

DOI10.1137/0209047zbMath0454.05038OpenAlexW2051748083WikidataQ105673110 ScholiaQ105673110MaRDI QIDQ3901544

László Babai, Stanley M. Selkow

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209047




Related Items (66)

Finite Variable Logics in Descriptive Complexity TheoryOn the Combinatorial Power of the Weisfeiler-Lehman AlgorithmOn the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-CompletenessGeneric case complexity of the graph isomorphism problemNew invariants for the graph isomorphism problemFast canonical labeling of random subgraphsOn the robustness of the metric dimension of grid graphs to adding a single edgeCanonization for two variables and puzzles on the squareGeneric complexity of the membership problem for semigroups of integer matricesTight lower and upper bounds for the complexity of canonical colour refinementHow to define a linear order on finite modelsAlmost every graph is vertex-obliqueEfficient random graph matching via degree profilesSpectra of symmetric powers of graphs and the Weisfeiler-Lehman refinementsGeneral linear group action on tensors: a candidate for post-quantum cryptographyPower-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphismGraph isomorphism, color refinement, and compactnessGraphs Identified by Logics with CountingOn Tinhofer’s Linear Programming Approach to Isomorphism TestingOn the Power of Color RefinementOn anti-stochastic properties of unlabeled graphsExact matching of random graphs with constant correlationGetting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its ApplicationsQuantum and non-signalling graph isomorphismsList-distinguishing Cartesian products of cliquesA Logspace Algorithm for Partial 2-Tree CanonizationAsymptotic theory in network models with covariates and a growing number of node parametersTheory of graph neural networks: representation and learningGroup-theoretic generalisations of vertex and edge connectivitiesConcerning the complexity of deciding isomorphism of block designsConstructing Hard Examples for Graph IsomorphismOptimal assignment of task modules with precedence for distributed processing by graph matching and state-space searchMalleability of complex networksIsomorphism for random \(k\)-uniform hypergraphsIsomorphism testing via polynomial-time graph extensionsUpper Bounds on the Quantifier Depth for Graph Differentiation in First Order LogicImproved Algorithms for Alternating Matrix Space Isometry: From Theory to PracticeExpected parallel time and sequential space complexity of graph and digraph problemsImproved random graph isomorphismOn leaf permutative theories and occurrence permutation groupsOn the power of combinatorial and spectral invariantsAn optimal lower bound on the number of variables for graph identificationOn the Weisfeiler-Leman dimension of fractional packingOn the complexity of deduction modulo leaf permutative equationsBenchmark Graphs for Practical Graph IsomorphismDescriptive complexity of graph spectraUnnamed ItemHashing and canonicalizing Notation 3 graphsGraph theory (algorithmic, algebraic, and metric problems)Metric dimension of critical Galton-Watson trees and linear preferential attachment treesTopological variability of collectives and its import for social epistemologyAn Average Case NP-complete Graph Colouring ProblemOn Weisfeiler-Leman invariance: subgraph counts and related graph propertiesA graph isomorphism algorithm for object recognitionCryptanalysis and improvements on some graph-based authentication schemesApproximate lumpability for Markovian agent-based models using local symmetriesRandomised algorithmsOn the local distinguishing numbers of cyclesFractional isomorphism of graphonsAlmost Everywhere Equivalence of Logics in Finite Model TheorySherali-Adams relaxations of graph isomorphism polytopesGraph isomorphism problemRandom Models and Analyses for Chemical GraphsOn the limiting distribution of the metric dimension for random forestsGraph recurrenceOn the Rigidity of Sparse Random Graphs







This page was built for publication: Random Graph Isomorphism