An Upper Bound for the Regularity of Symbolic Powers of Edge Ideals of Chordal Graphs.
Seyed Amin Seyed FakhariPublished in: Electron. J. Comb. (2019)
Keyphrases
- upper bound
- undirected graph
- lower bound
- weighted graph
- directed graph
- worst case
- graph structure
- approximation algorithms
- spanning tree
- lower and upper bounds
- error probability
- edge detection
- minimum spanning trees
- edge weights
- generalization error
- branch and bound
- branch and bound algorithm
- graph matching
- connected components
- vertex set
- partial order
- complex networks
- edge information
- random graphs
- high level
- data sets
- minimum cost
- edge map
- computational complexity
- image segmentation
- partially ordered
- np hard
- constant factor
- neural network
- graph mining