Lower bounds on the mim-width of some graph classes.
Stefan MengelPublished in: Discret. Appl. Math. (2018)
Keyphrases
- lower bound
- upper bound
- random walk
- min sum
- graph representation
- graph theory
- branch and bound
- directed graph
- structured data
- branch and bound algorithm
- connected components
- graph mining
- equivalence classes
- bipartite graph
- objective function
- np hard
- quadratic assignment problem
- graph theoretic
- bounded degree
- online algorithms
- linear programming relaxation
- worst case
- graph model
- graph structure