Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty.
Corinna MathwieserEranda ÇelaPublished in: Networks (2024)
Keyphrases
- color images
- special case
- undirected graph
- vertex set
- image processing
- np hard
- edge information
- approximation algorithms
- computational complexity
- edge detection
- edge weights
- edge detector
- disjoint paths
- computer vision
- uncertain data
- decision theory
- possibility theory
- inherent uncertainty
- directed graph
- case study
- belief functions
- artificial intelligence
- probability theory
- multiple scales
- attributed graphs
- machine learning
- edge direction
- database