Monitoring the edges of a graph using distances.
Florent FoucaudShih-Shun KaoRalf KlasingMirka MillerJoe RyanPublished in: Discret. Appl. Math. (2022)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- edge weights
- undirected graph
- directed acyclic graph
- nodes of a graph
- bipartite graph
- directed edges
- graph model
- monitoring system
- graph structure
- real time
- graph representation
- graph theory
- structured data
- distance function
- massive graphs
- random walk
- distance measure
- spectral embedding
- graph based algorithm
- graph clustering
- graph theoretic
- approximation algorithms
- graph matching
- minimum cost
- real world graphs
- vertex set
- probability measure
- distance matrix
- edge map
- graph databases
- graph mining
- multiscale