Login / Signup
The Möbius Function, Variations Ranks, and Theta(n)-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem
Christoph Meinel
Stephan Waack
Published in:
Electron. Colloquium Comput. Complex. (1994)
Keyphrases
</>
worst case
graph connectivity
upper bound
lower bound
weighted graph
computational complexity
bayesian networks
domain specific
knowledge acquisition
error tolerance