Inapproximability results and bounds for the Helly and Radon numbers of a graph.
Mitre Costa DouradoAline R. da SilvaPublished in: Discret. Appl. Math. (2017)
Keyphrases
- upper bound
- graph theory
- graph model
- approximation algorithms
- lower bound
- neural network
- weighted graph
- graph structure
- connected components
- random walk
- lower and upper bounds
- graph theoretic
- link analysis
- worst case
- structured data
- directed graph
- graph search
- special case
- graph clustering
- average case
- upper and lower bounds
- graph databases
- graph partitioning
- graph representation
- graph construction
- constant factor
- data sets
- graph mining
- learning algorithm
- clustering algorithm
- bipartite graph
- np hard
- knn