Locally Delaunay Realizability of Regular Series-Parallel Graphs

Grilli, L; Hong, S; Symvonis, A; Wormser, C

dc.contributor.author	Grilli, L	en
dc.contributor.author	Hong, S	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Wormser, C	en
dc.date.accessioned	2014-03-01T02:51:21Z
dc.date.available	2014-03-01T02:51:21Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35495
dc.subject	delaunay triangulation	en
dc.subject	Geometric Structure	en
dc.subject	Linear Time Algorithm	en
dc.subject	Network Topology	en
dc.subject	Series-parallel Graph	en
dc.subject	Wireless Ad Hoc Network	en
dc.title	Locally Delaunay Realizability of Regular Series-Parallel Graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICCSA.2008.60	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICCSA.2008.60	en
heal.publicationDate	2008	en
heal.abstract	This paper studies the combinatorial properties of geometric structures, known as k-locally Delaunay graphs, introduced in the application of wireless ad hoc networks. Given a network that models the connections among its sensors as a k-locally Delaunay graph, we investigate which topologies are allowed for such a network. We show that the family of regular series-parallel graphs, a subfamily of	en
heal.journalName	Computational Science and Its Applications	en
dc.identifier.doi	10.1109/ICCSA.2008.60	en