Higher dimensional hexagonal networks

No abstract is available for this paper.

• Publication year

  2003

• Venue

  J. Parallel Distributed Comput.

• Publication date

  2003-11-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/j.jpdc.2003.07.001
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Interconnection Networks: An Engineering Approach

  2002cited by this paper
• Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks

  2002cited by this paper
• Higher Dimensional Honeycomb Networks

  2001cited by this paper
• A Unified Formulation of Honeycomb and Diamond Networks

  2001cited by this paper
• A cell ID assignment scheme and its applications

  2000cited by this paper
• Topological properties and optimal routing algorithms for three dimensional hexagonal networks

  2000cited by this paper
• Honeycomb tori are Hamiltonian

  1999cited by this paper
• All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications

  1999cited by this paper
• Fault-Tolerant Ring Embedding in a Honeycomb Torus with Node Failures

  1999cited by this paper
• Performance of the CRAY T3E Multiprocessor

  1997cited by this paper
• Honeycomb Networks: Topological Properties and Communication Algorithms

  1997cited by this paper
• Resource placement in torus-based networks

  1996cited by this paper
• Lee Distance and Topological Properties of k-ary n-cubes

  1995cited by this paper
• Enumeration of Polyhex Hydrocarbons to h = 17

  1995cited by this paper
• Parallel and Distributed Computing Handbook

  1995cited by this paper
• High-Performance Computing on a Honeycomb Architecture

  1993cited by this paper
• Cray T3D: a new dimension for Cray Research

  1993cited by this paper
• iWarp: a 100-MOPS, LIW microprocessor for multicomputers

  1991cited by this paper
• HARTS: a distributed real-time architecture

  1991cited by this paper
• Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer

  1991cited by this paper
• System design of the J-Machine

  1990cited by this paper
• Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors

  1990cited by this paper
• Computer graphics on a hexagonal grid

  1984cited by this paper
• Article in Press

  year unknowncited by this paper

• Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes

  2022cites this paper
• Fault Tolerant Addressing Scheme for Oxide Interconnection Networks

  2022cites this paper
• Computing Some Degree‐Based Topological Indices of Honeycomb Networks

  2022cites this paper
• VULNERABILITY PARAMETERS IN HONEYCOMB NETWORKS

  2020cites this paper
• A Review of Embedding Hexagonal Cells in the Circular and Hexagonal Region of Interest

  2019influential citation
• Layout model for optical interconnects based on λ-routing grids and topology embeddings

  2018cites this paper
• Higher dimensional Eisenstein-Jacobi networks

  2017cites this paper
• On the number of shortest paths in Cartesian product graphs and its robustness

  2017cites this paper
• eu PARTITION DIMENSION OF HONEYCOMB DERIVED NETWORKS

  2016cites this paper
• A family of efficient six-regular circulants representable as a Kronecker product

  2016cites this paper
• Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers

  2015cites this paper
• 2-Power Domination in Certain Interconnection Networks

  2015cites this paper
• Analysis of Hexagonal Network Based on Cellular Automation

  2014cites this paper
• The number of shortest paths in the arrangement graph

  2013cites this paper
• A S URVEY ON A REA P LANNING FOR H ETEROGENEOUS N ETWORKS

  2013cites this paper
• A Survey On Area Planning For Heterogeneous Networks

  2013cites this paper
• ASURVEY ON AREA PLANNING F OR H ETEROGENEOUS N ETWORKS

  2013cites this paper
• The number of shortest paths in the (n, k)-star graph

  2010cites this paper
• Distance formula and shortest paths for the (n, k)-star graphs

  2010cites this paper
• Petersen-Twisted-Torus Networks for Multiprocessor Systems

  2010cites this paper
• A family of interconnection networks for multiprocessor systems

  2010cites this paper
• Computational Aspects of Carbon and Boron Nanotubes

  2010cites this paper
• Explorations of Honeycomb Topologies for Network-on-Chip

  2009influential citation
• Topological properties of silicate networks

  2009cites this paper
• On minimum metric dimension of honeycomb networks

  2008cites this paper
• An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks

  2008cites this paper
• Optimal Routing Algorithm and Diameter in Hexagonal Torus Networks

  2007cites this paper
• Topological Properties of Interconnection Networks

  2006cites this paper
• A Unified Addressing Schema for Hexagonal and Honeycomb Networks with Isomorphic Cayley Graphs

  2006cites this paper
• 3D hexagonal network: modeling, topological properties, addressing scheme, and optimal routing algorithm

  2005cites this paper