A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph.
Yongyan GuoGang WuPublished in: SIAM J. Matrix Anal. Appl. (2022)
Keyphrases
- lower bound
- upper bound
- undirected graph
- labeled graphs
- constant factor
- directed graph
- branch and bound algorithm
- maximum clique
- minimum weight
- weighted graph
- graph representation
- vertex set
- attributed graphs
- worst case
- np hard
- hamiltonian cycle
- objective function
- random walk
- edge weights
- branch and bound
- optimal solution
- graph mining
- bipartite graph
- approximation algorithms
- graph theoretic
- maximal cliques
- graph matching
- directed acyclic graph
- graph data
- bounded treewidth
- online learning
- linear programming
- search space