Is there any polynomial upper bound for the universal labeling of graphs?
Arash AhadiAli DehghanMorteza SaghafianPublished in: J. Comb. Optim. (2017)
Keyphrases
- upper bound
- lower bound
- reachability queries
- worst case
- active learning
- low order
- upper and lower bounds
- graph matching
- directed graph
- branch and bound algorithm
- lower and upper bounds
- sample complexity
- graph mining
- image segmentation
- spanning tree
- graph partitioning
- branch and bound
- unsupervised learning
- error probability
- graph databases
- neural network
- graph structure
- constant factor
- series parallel