Monitoring the Edges of a Graph Using Distances.
Florent FoucaudRalf KlasingMirka MillerJoe RyanPublished in: CALDAM (2020)
Keyphrases
- weighted graph
- directed graph
- undirected graph
- edge weights
- spanning tree
- directed acyclic graph
- monitoring system
- real time
- graph theory
- random walk
- real world graphs
- euclidean distance
- graph representation
- distance measure
- maximum matching
- stable set
- nodes of a graph
- edge information
- graph mining
- structured data
- graph partitioning
- graph theoretic
- graph structure
- bipartite graph
- connected components
- directed edges
- shortest path
- graph based algorithm