On a lower bound for the connectivity of the independence complex of a graph.
Michal AdamaszekJonathan Ariel BarmakPublished in: Discret. Math. (2011)
Keyphrases
- optimal solution
- lower bound
- branch and bound algorithm
- branch and bound
- np hard
- upper bound
- knapsack problem
- linear programming
- connected components
- real world
- random walk
- neural network
- graph representation
- high level
- graph theory
- complex structures
- complex systems
- bipartite graph
- binary images
- graph mining
- graph databases
- worst case
- pairwise
- lower and upper bounds