Inapproximability results for graph convexity parameters.

Erika M. M. Coelho Mitre Costa Dourado Rudini M. Sampaio

Published in: Theor. Comput. Sci. (2015)

Keyphrases

maximum likelihood
parameter estimation
sensitivity analysis
parameter values
random walk
directed graph
graph matching
bipartite graph
graph structure
graph partitioning
connected components
parameter space
approximation algorithms
weighted graph
graph mining
input parameters