Recognizing binary Hamming graphs inO(n 2 logn) time

DOI10.1007/BF01185863zbMATH Open0833.68087OpenAlexW1586747704MaRDI QIDQ4850329FDOQ4850329

Authors: 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

Recommendations

• scientific article; zbMATH DE number 139782
• Recognizing Hamming graphs in linear time and space
• On the complexity of recognizing Hamming graphs and related classes of graphs

zbMATH Keywords

Hamming graph

Mathematics Subject Classification ID

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

Cites Work

• On the Addressing Problem for Loop Switching
• Isometric embedding in products of complete graphs
• Distance-preserving subgraphs of hypercubes
• Isometric embeddings in Hamming graphs
• Title not available (Why is that?)
• On cubical graphs
• Computing equivalence classes among the edges of a graph with applications
• Cost Trade-offs in Graph Embeddings, with Applications
• Recursive mesh refinement on hypercubes
• On the Addressing Problem of Loop Switching

Cited In (12)

• Fast recognition algorithms for classes of partial cubes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognizing Hamming graphs in linear time and space
• Omega polynomial in nanostructures
• Cubic inflation, mirror graphs, regular maps, and partial cubes
• Wiener number of vertex-weighted graphs and a chemical application
• Tiled partial cubes
• Recognizing median graphs in subquadratic time
• Linear recognition and embedding of Fibonacci cubes
• The lattice dimension of a graph
• Algorithms for media

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850329)