SOFSEM 2006: Theory and Practice of Computer Science
From MaRDI portal
Publication:5897980
DOI10.1007/11611257zbMath1175.68026OpenAlexW2756057450MaRDI QIDQ5897980
Marc Benkert, Joachim Gudmundsson, Alexander Wolff, Herman J. Haverkort
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11611257
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Distance-preserving approximations of polygonal paths ⋮ Minimizing interference of a wireless ad-hoc network in a plane ⋮ Optimal Higher Order Delaunay Triangulations of Polygons ⋮ Towards a definition of higher order constrained Delaunay triangulations ⋮ Minimum Total Node Interference in Wireless Sensor Networks ⋮ Optimal higher order Delaunay triangulations of polygons
This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science
