On the bounds of feedback numbers of (n, k)-star graphs.
Jian WangXirong XuDejun ZhuLiqing GaoJun-Ming XuPublished in: Inf. Process. Lett. (2012)
Keyphrases
- upper bound
- lower bound
- worst case
- upper and lower bounds
- error bounds
- graph theory
- structured objects
- image segmentation
- relevance feedback
- graph matching
- graph representation
- graph databases
- approximation algorithms
- graph clustering
- graph theoretic
- graph partitioning
- graph mining
- user feedback
- neural network
- learning environment
- learning algorithm