Monitoring the edges of a graph using distances.
Florent FoucaudShih-Shun KaoRalf KlasingMirka MillerJoe RyanPublished in: CoRR (2020)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- undirected graph
- edge weights
- directed acyclic graph
- random walk
- directed edges
- graph theory
- graph theoretic
- real time
- euclidean distance
- real world graphs
- graph structure
- spectral embedding
- monitoring system
- bipartite graph
- graph representation
- distance function
- graph model
- vertex set
- graph data
- edge detector
- massive graphs
- nodes of a graph
- stable set
- graph mining
- graph partitioning
- minimum cost
- dissimilarity measure
- connected components
- structured data
- distance measure
- social networks