An Efficient representation for sparse graphs

The design of efficient graph algorithms usually precludes the test of edge existence, because an efficient support of that operation already requires time (n^2) for the initialization of an adjacency-matrix representation. We describe an alternative representation of static directed graphs taking (...

Descripción completa

Detalles Bibliográficos
Autor: Valiente Feruglio, Gabriel Alejandro|||0000-0001-9194-2703
Tipo de recurso: informe técnico
Fecha de publicación:2002
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/97556
Acceso en línea:https://hdl.handle.net/2117/97556
Access Level:acceso abierto
Palabra clave:Graph algorithms
Static directed graphs
Representation
Sparse graphs
Àrees temàtiques de la UPC::Informàtica
id ES_8958dddcdf07fe8f0bcbd9e19a246b5b
oai_identifier_str oai:upcommons.upc.edu:2117/97556
network_acronym_str ES
network_name_str España
repository_id_str
spelling An Efficient representation for sparse graphsValiente Feruglio, Gabriel Alejandro|||0000-0001-9194-2703Graph algorithmsStatic directed graphsRepresentationSparse graphsÀrees temàtiques de la UPC::InformàticaThe design of efficient graph algorithms usually precludes the test of edge existence, because an efficient support of that operation already requires time (n^2) for the initialization of an adjacency-matrix representation. We describe an alternative representation of static directed graphs taking (n+m) initialization time and using (n^2) space, which supports the efficient implementation of all usual operations on static graphs. The sparse graph representation allows the design of efficient graph algorithms using both iteration over all vertices adjacent with a given vertex and edge-existence operations, although at the expense of additional (uninitialized) space which may, nevertheless, be used for other purposes. To the best of our knowledge, the representation leads to the first graph algorithms with the disconcerting property that the time complexity is better than the space complexity.20022002-02-0120162016-11-30reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/97556reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/975562026-05-27T15:37:01Z
dc.title.none.fl_str_mv An Efficient representation for sparse graphs
title An Efficient representation for sparse graphs
spellingShingle An Efficient representation for sparse graphs
Valiente Feruglio, Gabriel Alejandro|||0000-0001-9194-2703
Graph algorithms
Static directed graphs
Representation
Sparse graphs
Àrees temàtiques de la UPC::Informàtica
title_short An Efficient representation for sparse graphs
title_full An Efficient representation for sparse graphs
title_fullStr An Efficient representation for sparse graphs
title_full_unstemmed An Efficient representation for sparse graphs
title_sort An Efficient representation for sparse graphs
dc.creator.none.fl_str_mv Valiente Feruglio, Gabriel Alejandro|||0000-0001-9194-2703
author Valiente Feruglio, Gabriel Alejandro|||0000-0001-9194-2703
author_facet Valiente Feruglio, Gabriel Alejandro|||0000-0001-9194-2703
author_role author
dc.subject.none.fl_str_mv Graph algorithms
Static directed graphs
Representation
Sparse graphs
Àrees temàtiques de la UPC::Informàtica
topic Graph algorithms
Static directed graphs
Representation
Sparse graphs
Àrees temàtiques de la UPC::Informàtica
description The design of efficient graph algorithms usually precludes the test of edge existence, because an efficient support of that operation already requires time (n^2) for the initialization of an adjacency-matrix representation. We describe an alternative representation of static directed graphs taking (n+m) initialization time and using (n^2) space, which supports the efficient implementation of all usual operations on static graphs. The sparse graph representation allows the design of efficient graph algorithms using both iteration over all vertices adjacent with a given vertex and edge-existence operations, although at the expense of additional (uninitialized) space which may, nevertheless, be used for other purposes. To the best of our knowledge, the representation leads to the first graph algorithms with the disconcerting property that the time complexity is better than the space complexity.
publishDate 2002
dc.date.none.fl_str_mv 2002
2002-02-01
2016
2016-11-30
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/97556
url https://hdl.handle.net/2117/97556
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869412619954159616
score 15,301603

Similares en LA Referencia