A 34-approximation of Vizing's conjecture for claw-free graphs.
Bostjan BresarMichael A. HenningPublished in: Discret. Appl. Math. (2020)
Keyphrases
- series parallel
- error bounds
- approximation algorithms
- graph mining
- approximation error
- relative error
- graph representation
- undirected graph
- graph databases
- bipartite graph
- data sets
- graph clustering
- approximation methods
- low degree
- efficient computation
- adjacency matrix
- approximation ratio
- laplacian matrix
- continuous functions
- random graphs
- graph theory
- graph matching
- np hard
- pairwise
- clustering algorithm