Approximate distance oracles for graphs with dense clusters

dc.creator	Andersson, Mattias	es
dc.creator	Gudmundsson, Joachim	es
dc.creator	Levcopoulos, Christos	es
dc.date.accessioned	2017-03-01T11:22:09Z
dc.date.available	2017-03-01T11:22:09Z
dc.date.issued	2004
dc.identifier.citation	Andersson, M., Gudmundsson, J. y Levcopoulos, C. (2004). Approximate distance oracles for graphs with dense clusters. En 20th European Workshop on Computational Geometry, Sevilla.
dc.identifier.uri	http://hdl.handle.net/11441/55008
dc.description.abstract	Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answers (1 + ε)-approximate shortest path queries in G in constant time, where n is the number of vertices of G.	es
dc.description.sponsorship	Netherlands Organisation for Scientific Research	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.relation.ispartof	20th European Workshop on Computational Geometry (2004).
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	Approximate distance oracles for graphs with dense clusters	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dc.type.version	info:eu-repo/semantics/submittedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
idus.format.extent	4 p.	es
dc.eventtitle	20th European Workshop on Computational Geometry	es
dc.eventinstitution	Sevilla	es

Ficheros	Tamaño	Formato	Ver	Descripción
Approximate distance oracles for ...	134.1Kb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional