New bounds on the edge-bandwidth of triangular grids

DOI10.1051/ita/2014027zbMath1314.05177OpenAlexW2037368146MaRDI QIDQ5245726

Yanpei Liu, Lan Lin

Publication date: 15 April 2015

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2014027

zbMATH Keywords

bandwidthminimax problemtriangular gridlabeling algorithmedge bandwidth

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Cutwidth of triangular grids
• Edge-bandwidth of grids and tori
• Edge-bandwidth of the triangular grid
• Optimal labelling of a product of two paths
• On the bandwidth of triangulated triangles
• New results on edge-bandwidth
• On the edge-bandwidth of graph products
• Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
• The bandwidth problem for graphs and matrices—a survey
• Edge-Bandwidth of Graphs
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: New bounds on the edge-bandwidth of triangular grids