Hamiltonian cycles in faulty random geometric networks

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/97653

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.author	Petit Silvestre, Jordi
dc.date	2001-03
dc.identifier.citation	Petit, J. "Hamiltonian cycles in faulty random geometric networks". 2001.
dc.identifier.uri	http://hdl.handle.net/2117/97653
dc.language.iso	eng
dc.relation	LSI-01-8-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica
dc.subject	Hamiltonian cycles
dc.subject	Faulty random geometric networks
dc.title	Hamiltonian cycles in faulty random geometric networks
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.abstract	In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when considering wireless broadcast networks. A random geometric network is a graph whose vertices correspond to points uniformly and independently distributed in the unit square, and whose edges connect any pair of vertices if their distance is below some specified bound. A faulty random geometric network is a random geometric network whose vertices or edges fail at random. Algorithms to find Hamiltonian cycles in faulty random geometric networks are presented.