Is there any polynomial upper bound for the universal labeling of graphs?
Arash AhadiAli DehghanMorteza SaghafianPublished in: CoRR (2017)
Keyphrases
- upper bound
- lower bound
- worst case
- reachability queries
- branch and bound
- active learning
- graph theory
- graph mining
- lower and upper bounds
- upper and lower bounds
- branch and bound algorithm
- graph theoretic
- graph databases
- label propagation
- random graphs
- graph model
- generalization error
- graph data
- labeling scheme
- neural network
- graph kernels
- error probability
- bounded degree