Application of neighborhood sequences in communication of hexagonal networks

DOI10.1016/J.DAM.2015.10.034MaRDI QIDQ528338zbMATH OpenOpenAlexFDO

Authors Benedek Nagy

Publication date 12 May 2017

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.10.034

zbMATH Keywords

communicationhexagonal networkneighborhood sequencesdigital discsdigital distancesvarious signal speed

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Communication, information (94A99)

Recommendations

• Higher dimensional hexagonal networks
• Combinatorial Image Analysis
• Geometry of Neighborhood Sequences in Hexagonal Grid
• Packing of hexagonal networks
• Neighborhood Communications in Networks

Cites work

• scientific article; zbMATH DE number 2099143 (Why is no real title available?)
• Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
• Broadcasting automata and patterns on \(\mathbb{Z}^2\)
• Combinatorial Image Analysis
• Distance functions defined by variable neighbourhood sequences
• Distance functions in digital geometry
• Distances defined by neighborhood sequences
• Generalized distances in digital geometry
• Geometry of Neighborhood Sequences in Hexagonal Grid

Cited in

(2)

• Non-traditional 2D grids in combinatorial imaging -- advances and challenges
• Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach

This page was built for publication: Application of neighborhood sequences in communication of hexagonal networks

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