Fast canonical labeling of random subgraphs

DOI10.1134/S1064562413020154zbMath1272.05186MaRDI QIDQ2375981

M. I. Tikhomirov

Publication date: 25 June 2013

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphsgraph isomorphism problemcanonical labelings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved random graph isomorphism
• Asymptotic normality of subcubes in random subgraphs of the \(n\)-cube
• The Giant Component in a Random Subgraph of a Given Graph
• Random Graph Isomorphism
• The Evolution of Random Subgraphs of the Cube
• On the diameter and radius of randon subgraphs of the cube
• Connectivity properties of random subgraphs of the cube
• The Spectral Gap of a Random Subgraph of a Graph

This page was built for publication: Fast canonical labeling of random subgraphs