Adjacency Maps and Efficient Graph Algorithms

Adjacency Maps and Efficient Graph Algorithms

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 rep...

Full description

Bibliographic Details
Main Author: Gabriel Valiente
Format: Article
Language:English
Published: MDPI AG 2022-02-01
Series:Algorithms
Subjects:
discrete mathematics
graph theory
performance and testing of algorithms
adjacency matrices
adjacency lists
adjacency maps
Online Access:https://www.mdpi.com/1999-4893/15/2/67

Internet

https://www.mdpi.com/1999-4893/15/2/67

Similar Items