Lower bounds for graph bootstrap percolation via properties of polynomials.
Lianna HambardzumyanHamed HatamiYingjie QianPublished in: J. Comb. Theory, Ser. A (2020)
Keyphrases
- lower bound
- upper bound
- graph theory
- graph properties
- graph structure
- bipartite graph
- objective function
- graph partitioning
- branch and bound algorithm
- branch and bound
- np hard
- directed graph
- graph matching
- structural properties
- cross validation
- worst case
- graph model
- graph databases
- data structure
- graph representation
- vc dimension
- clustering coefficient
- clustering algorithm