Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes.
Sayani DasSounaka MishraPublished in: Discret. Math. Algorithms Appl. (2020)
Keyphrases
- lower bound
- undirected graph
- directed graph
- upper bound
- minimum weight
- edge weights
- graph structure
- attributed graphs
- branch and bound algorithm
- objective function
- connected components
- labeled graphs
- hamiltonian cycle
- directed acyclic graph
- vertex set
- spanning tree
- weighted graph
- approximation algorithms
- graph theory
- worst case
- equivalence classes
- random graphs
- structured data
- bipartite graph
- average degree
- graph representation
- vc dimension
- branch and bound
- minimum spanning tree
- constant factor
- complex networks
- maximum cardinality
- linear programming
- random walk
- max sat
- graph matching
- learning algorithm