Locally delaunay readability of regular series-parallel graphs

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

dc.contributor.author	Grilli, L	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Hong, S-H	en
dc.contributor.author	Wormser, C	en
dc.date.accessioned	2014-03-01T02:51:44Z
dc.date.available	2014-03-01T02:51:44Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35616
dc.subject.other	Ad hoc networks	en
dc.subject.other	Computational geometry	en
dc.subject.other	Parallel algorithms	en
dc.subject.other	Sensor networks	en
dc.subject.other	Wireless telecommunication systems	en
dc.subject.other	Combinatorial properties	en
dc.subject.other	Computational sciences	en
dc.subject.other	Delaunay	en
dc.subject.other	Delaunay graph	en
dc.subject.other	Geometric structures	en
dc.subject.other	International conferences	en
dc.subject.other	Linear-time algorithms	en
dc.subject.other	Series-parallel graphs	en
dc.subject.other	Wireless ad hoc networks	en
dc.subject.other	Graph theory	en
dc.title	Locally delaunay readability 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.identifier.secondary	4561251	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 two-terminal series parallel graphs, can be realized as klocally Delaunay graphs for any value of k. More precisely, for any regular series-parallel graph, we present a linear time algorithm for constructing the corresponding k-locally Delaunay graph for any value of k. © 2008 IEEE.	en
heal.journalName	Proceedings - The International Conference on Computational Sciences and its Applications, ICCSA 2008	en
dc.identifier.doi	10.1109/ICCSA.2008.60	en
dc.identifier.spage	461	en
dc.identifier.epage	467	en