Adjacency maps and efficient graph algorithms
Visualitza/Obre
Cita com:
hdl:2117/369749
Tipus de documentArticle
Data publicació2022-02-20
EditorMultidisciplinary Digital Publishing Institute (MDPI)
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement 4.0 Internacional
Abstract
Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In this article, we review the adjacency-map representation, which supports adjacency tests in constant expected time, and we show that graph algorithms run faster with adjacency maps than with adjacency lists by a small constant factor if they do not test adjacencies and by one or two orders of magnitude if they perform adjacency tests.
CitacióValiente, G. Adjacency maps and efficient graph algorithms. "Algorithms", 20 Febrer 2022, vol. 15, núm. 2, article 67, p. 1-10.
ISSN1999-4893
Versió de l'editorhttps://www.mdpi.com/1999-4893/15/2/67
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
algorithms-15-00067-v2.pdf | 5,330Mb | Visualitza/Obre |