On a Lower Bound for the Eccentric Connectivity Index of Graphs.
Devsi BantvaPublished in: CALDAM (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- objective function
- database
- graph matching
- branch and bound
- optimal solution
- np hard
- topological information
- graph theoretic
- connected components
- graph model
- bipartite graph
- index structure
- graph representation
- sample complexity
- linear programming relaxation
- topological features
- graph databases
- sufficiently accurate
- graph mining
- graph structure
- graph theory
- worst case
- weighted graph
- indexing techniques
- random graphs
- topological properties
- directed graph
- online learning
- query graph
- data structure