Recognizing binary Hamming graphs inO(n 2 logn) time-Reference-Cited by-同舟云学术

Recognizing binary Hamming graphs inO(n 2 logn) time

Published:1995-09 Issue:5 Volume:28 Page:387-395
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Aurenhammer F.,Hagauer J.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01185863.pdf

Reference12 articles.

1. Aurenhammer, F., and Hagauer, J. Computing equivalence classes among the edges of a graph with applications.Discrete Math. 109 (1992), 3?12.

2. Brandenburg, L. H., Gopinath, B., and Kurshan, R. P. On the addressing problem of loop switching.Bell Systems Tech. J. 51 (1972), 1445?1469.

3. Djokovic, D. Z. Distance-preserving subgraphs of hypercubes.J. Combin. Theory Ser. B 14 (1973), 263?267.

4. Garey, M. R., and Graham, R. L. On cubical graphs.J. Combin. Theory Ser. B 18 (1975), 84?95.

5. Gilbert, E. N. Gray codes and paths on then-cube.Bell Systems Tech. J. 37 (1958), 1?12.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Omega Polynomial in Nanostructures;Distance, Symmetry, and Topology in Carbon Nanomaterials;2016

2. Linear Recognition and Embedding of Fibonacci Cubes;Algorithmica;2013-10-02

3. Near Products;Handbook of Product Graphs;2011-06-06

4. Algorithms for media;Discrete Applied Mathematics;2008-04

5. The lattice dimension of a graph;European Journal of Combinatorics;2005-07