Edge Lower Bounds for List Critical Graphs, Via Discharging.
Daniel W. CranstonLandon RabernPublished in: Comb. (2018)
Keyphrases
- lower bound
- weighted graph
- upper bound
- undirected graph
- edge detection
- branch and bound algorithm
- minimum spanning trees
- np hard
- upper and lower bounds
- lower bounding
- edge detector
- ranked list
- graph theoretic
- lower and upper bounds
- linear programming relaxation
- graph theory
- objective function
- image processing
- worst case
- vc dimension
- graph representation
- graph model
- directed graph
- complex networks
- np complete
- edge information
- optimal solution
- edge weights
- random graphs
- vertex set