Lower bounds for strictly fundamental cycle bases in grid graphs.
Ekkehard KöhlerChristian LiebchenGregor WünschRomeo RizziPublished in: Networks (2009)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- grid computing
- graph matching
- graph databases
- upper and lower bounds
- objective function
- worst case
- graph theoretic
- spanning tree
- weighted graph
- quadratic assignment problem
- graph representation
- graph model
- graph structure
- graph theory
- graph mining
- social networks
- bipartite graph
- lower and upper bounds
- directed graph
- np complete
- graph clustering
- optimal solution
- lower bounding
- grid points
- min sum