Explore tens of thousands of sets crafted by our community.
Dynamic Graph Algorithms
5
Flashcards
0/5
Dynamic Trees
Supports operations on a tree dynamically as it undergoes changes like edge insertions or deletions.
Dynamic Shortest Paths
Recalculates or updates shortest paths in a graph when weights are changed or edges are added/removed.
Fully Dynamic Connectivity
Maintains information about connectivity in a graph that undergoes additions and deletions of edges.
Dynamic Minimum Spanning Tree
Alters the minimum spanning tree (MST) of a weighted graph when the graph is updated.
Subgraph Isomorphism in Dynamic Graphs
Determines if a pattern graph is a subgraph of the main graph as the main graph undergoes changes.
© Hypatia.Tech. 2024 All rights reserved.
