An upper bound on adaptable choosability of graphs.
Mickaël MontassierAndré RaspaudXuding ZhuPublished in: Eur. J. Comb. (2009)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- worst case
- graph matching
- upper and lower bounds
- graph theoretic
- branch and bound
- graph mining
- lower and upper bounds
- graph isomorphism
- error probability
- graph model
- series parallel
- graph partitioning
- sample complexity
- undirected graph
- graph databases
- directed graph
- pattern recognition
- spanning tree
- neural network
- np hard
- graph kernels
- single item
- case study
- information systems