Local Approximation of the Maximum Cut in Regular Graphs.
Étienne BamasLouis EsperetPublished in: WG (2019)
Keyphrases
- integrality gap
- linear programming relaxation
- closed form
- graph mining
- graph theoretic
- approximation algorithms
- error bounds
- relative error
- graph matching
- graph theory
- weighted graph
- graph databases
- graph partitioning
- planar graphs
- maximum error
- subgraph isomorphism
- maximum number
- approximation schemes
- vertex set
- absolute error
- series parallel
- graph representation
- data sets
- undirected graph
- directed graph
- special case
- neural network