A sharp lower bound for the Wiener index of a graph
R. BalakrishnanN. SridharanK. Viswanathan IyerPublished in: CoRR (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- graph representation
- graph structure
- weighted graph
- constant factor
- graph theoretic
- graph partitioning
- worst case
- np hard
- graph matching
- directed graph
- index structure
- sample complexity
- high quality
- directed acyclic graph
- graph databases
- spanning tree
- random walk
- online algorithms