Approximation bounds on maximum edge 2-coloring of dense graphs.
L. Sunil ChandranRogers MathewDeepak RajendraprasadNitin SinghPublished in: CoRR (2018)
Keyphrases
- weighted graph
- error bounds
- densely connected
- undirected graph
- error tolerance
- stage stochastic programs
- approximation methods
- upper bound
- approximation guarantees
- lower bound
- approximation algorithms
- minimum spanning trees
- edge detection
- quasi cliques
- upper and lower bounds
- graph matching
- approximation error
- graph theoretic
- graph clustering
- markovian decision
- edge information
- vertex set
- graph theory
- edge detector
- maximum error
- closed form
- graph databases
- graph kernels
- edge weights
- graph model
- greedy algorithm
- objective function
- relative error
- spanning tree
- multiscale
- community detection
- directed graph
- markov random field
- worst case
- worst case bounds
- special case