Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems.
Christoph MeinelStephan WaackPublished in: LATIN (1995)
Keyphrases
- lower bound
- average case complexity
- upper bound
- np complete
- worst case
- optimization problems
- structured data
- graph theory
- decision problems
- polynomial hierarchy
- min sum
- objective function
- branch and bound algorithm
- communication networks
- graph mining
- average case
- np hardness
- information sharing
- special case
- tractable cases
- computational complexity