A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph.
Francesco M. MalvestutoMauro MezziniPublished in: SIAM J. Comput. (2002)
Keyphrases
- weighted graph
- edge weights
- spanning tree
- edge detection algorithm
- minimum weight
- shortest path
- vertex set
- graph structure
- edge information
- graph partitioning
- minimum spanning tree
- k means
- graph model
- minimum cut
- edge detection
- np hard
- high dimensional
- undirected graph
- multiscale
- graph connectivity
- image edges
- tree structure
- probabilistic model
- optimal solution