Recognizing binary Hamming graphs inO(n 2 logn) time

DOI10.1007/BF01185863zbMath0833.68087OpenAlexW1586747704MaRDI QIDQ4850329

Franz Aurenhammer, Johann Hagauer

Publication date: 9 October 1995

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01185863

zbMATH Keywords

Hamming graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Tiled partial cubes ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Fast recognition algorithms for classes of partial cubes ⋮ Omega Polynomial in Nanostructures ⋮ Cubic inflation, mirror graphs, regular maps, and partial cubes ⋮ Algorithms for media ⋮ The lattice dimension of a graph ⋮ Recognizing median graphs in subquadratic time ⋮ Linear recognition and embedding of Fibonacci cubes

Cites Work

• Unnamed Item
• Computing equivalence classes among the edges of a graph with applications
• Isometric embedding in products of complete graphs
• Isometric embeddings in Hamming graphs
• Recursive mesh refinement on hypercubes
• On cubical graphs
• Distance-preserving subgraphs of hypercubes
• Cost Trade-offs in Graph Embeddings, with Applications
• On the Addressing Problem for Loop Switching
• On the Addressing Problem of Loop Switching

This page was built for publication: Recognizing binary Hamming graphs inO(n 2 logn) time