1. Li Y, Nie F, Huang H, et al. Large-scale multi-view spectral clustering via bipartite graph. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, Austin, 2015. 2750–2756
2. Gu T L, Chang L, Xu Z B. A novel symbolic algorithm for maximum weighted matching in bipartite graphs. Int J Commun Netw Syst Sci, 2011, 4: 111–121
3. Beale S. Using branch-and-bound with constraint satisfaction in optimization problems. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference, Providence, 1997. 209–214
4. Lelis L H S, Otten L, Dechter R. Predicting the size of depth-first branch and bound search trees. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, 2013
5. Zhan C, Xiao F. Coding based wireless broadcast scheduling in real time applications. J Network Comput Appl, 2016, 64: 194–203