An entropy based proof of the Moore bound for irregular graphs
Ajesh BabuJaikumar RadhakrishnanPublished in: CoRR (2010)
Keyphrases
- lower bound
- series parallel
- error bounds
- graph theoretic
- graph partitioning
- upper bound
- linear logic
- graph theory
- estimation error
- complex structures
- graph structure
- graph representation
- random graphs
- graph databases
- graph structures
- arbitrarily shaped
- subgraph isomorphism
- directed graph
- worst case
- image pyramids
- irregularly shaped