A lower bound on the eccentric connectivity index of a graph.
M. J. MorganSimon MukwembiHenda C. SwartPublished in: Discret. Appl. Math. (2012)
Keyphrases
- lower bound
- upper bound
- connected components
- graph connectivity
- branch and bound algorithm
- graph representation
- optimal solution
- strongly connected
- graph theory
- branch and bound
- directed graph
- worst case
- graph matching
- graph structure
- constant factor
- graph theoretic
- lower and upper bounds
- structured data
- database
- topological information
- random walk
- objective function
- lower bounding
- np hard
- graph mining
- directed acyclic graph
- weighted graph
- graph partitioning
- undirected graph
- graph model
- linear programming relaxation
- search space
- semi supervised