A probabilistic upper bound for the edge identification complexity of graphs.
Eberhard TrieschPublished in: Discret. Math. (1994)
Keyphrases
- upper bound
- worst case
- lower bound
- weighted graph
- undirected graph
- bayesian networks
- objective function
- computational complexity
- graph representation
- edge information
- branch and bound algorithm
- graph matching
- uncertain data
- graph theory
- posterior probability
- graph model
- directed graph
- graph databases
- decision problems
- probabilistic model
- lower and upper bounds
- graph structures