Sharp lower bounds on the Narumi-Katayama index of graph operations.
Mahdieh AzariPublished in: Appl. Math. Comput. (2014)
Keyphrases
- lower bound
- upper bound
- min sum
- random walk
- branch and bound algorithm
- constant factor
- graph theory
- database
- objective function
- graph representation
- directed acyclic graph
- np hard
- graph structure
- branch and bound
- learning algorithm
- vc dimension
- directed graph
- structured data
- index structure
- data structure
- optimal solution
- high quality
- b tree
- connected components
- special case
- graph mining
- graph model
- undirected graph
- linear programming relaxation
- graph search
- database systems
- bit wise