Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm: poster abstract.
Youssef N. AltherwyEhab S. ElmallahJulie A. McCannPublished in: SenSys (2019)
Keyphrases
- segmentation algorithm
- learning algorithm
- worst case
- computational complexity
- np hard
- computational cost
- graph isomorphism
- detection algorithm
- probabilistic model
- preprocessing
- dynamic programming
- minimum spanning tree
- bayesian networks
- polynomial time complexity
- graph structure
- expectation maximization
- cost function
- matching algorithm
- graph matching
- generative model
- graph model
- spanning tree
- graph clustering
- approximation ratio
- randomized algorithm
- linear programming
- finding the shortest path
- context free parsing