Recognizing Hamming graphs in linear time and space

DOI10.1016/S0020-0190(97)00095-1zbMath1337.68132OpenAlexW2093944943MaRDI QIDQ287143

Wilfried Imrich, Sandi Klavžar

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00095-1

zbMATH Keywords

analysis of algorithmsdesign of algorithmsHamming graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

On the \(P_3\)-hull number of Hamming graphs ⋮ Two-closure of rank \(3\) groups in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Graph multiplication
• Isometric embedding in products of complete graphs
• Isometric embeddings in Hamming graphs
• On the complexity of testing a graph for n-cube
• The retracts of Hamming graphs
• Cartesian graph factorization at logarithmic cost per edge
• Universal classes of hash functions
• Geometric algorithms and combinatorial optimization.
• On the complexity of recognizing Hamming graphs and related classes of graphs
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Quasi‐median graphs and algebras

This page was built for publication: Recognizing Hamming graphs in linear time and space