Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
431132 | Journal of Discrete Algorithms | 2008 | 8 Pages |
Abstract
A minimum metric basis is a minimum set W of vertices of a graph G(V,E)G(V,E) such that for every pair of vertices u and v of G , there exists a vertex w∈Ww∈W with the condition that the length of a shortest path from u to w is different from the length of a shortest path from v to w. The honeycomb and hexagonal networks are popular mesh-derived parallel architectures. Using the duality of these networks we determine minimum metric bases for hexagonal and honeycomb networks.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paul Manuel, Rajan Bharati, Indra Rajasingh, Chris Monica M,