Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems.
Christoph MeinelStephan WaackPublished in: Math. Syst. Theory (1996)
Keyphrases
- lower bound
- decision problems
- average case complexity
- polynomial time complexity
- np complete
- image segmentation
- upper bound
- image registration
- worst case
- optimization problems
- special case
- computational complexity
- directed graph
- branch and bound algorithm
- learning theory
- bipartite graph
- graph theory
- graph structure
- np hardness
- data structure
- objective function