Author:
Xiao Mingyu,Huang Sen,Chen Xiaoyu
Funder
Sichuan Natural Science Foundation
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference34 articles.
1. Akiba, T., Iwata, Y.: Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover. Theoret. Comput. Sci. 609, 211–225 (2016)
2. Been, K., Daiches, E., Yap, C.K.: Dynamic map labeling. IEEE Trans. Vis. Comput. Graph. 12(5), 773–780 (2006)
3. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 856–857 (1999)
4. Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Fast algorithms for max independent set. Algorithmica 62(1), 382–415 (2012)
5. Bourgeois, N., Escoffier, B., Paschos, V.T.: An O*(1.0977$${}^{\text{n}}$$) exact algorithm for max independent set in sparse graphs. In: Parameterized and Exact Computation, pp. 55–65 (2008)