February 2018
Intermediate to advanced
1120 pages
53h 40m
English
Camil Demetrescu
Sapienza University of Rome
Irene Finocchi
Sapienza University of Rome
Giuseppe F. Italiano
University of Rome Tor Vergata
37.2Techniques for Undirected Graphs
Clustering•Sparsification•Randomization
37.3Techniques for Directed Graphs
Kleene Closures•Long Paths•Locality•Matrices
Deletions in O(log2 n) Time•Updates in O(log4 n) Time
Updates in O(n2 log n) Time•Updates in O(n2) Time
Updates in Time•Updates in O(n2 log3 n) Time
In many applications of graph algorithms, including communication networks, ...
Read now
Unlock full access