Author:
Chang Maw-Shang,Chen Li-Hsuan,Hung Ling-Ju
Publisher
Springer Science and Business Media LLC
Reference33 articles.
1. Balakrishnan, H., Barrett, C.L., Anil Kumar, V.S., Marathe, M.V., Thite., S.: The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE J. Select. Areas Commun. 22 (6), 1069–1079 (2004)
2. Binkele-Raible, D., Brankovic, L., Cygan, M., Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Pilipczuk, M., Rossmanith, P., Wojtaszczyk, J.O.: Breaking the $$2^n$$ 2 n -barrier for irredundance: two lines of attack. J. Discret. Algorithms 9, 214–230 (2011)
3. Bourgeois, N., Escoffier, B., Paschos, VTh: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159, 1954–1970 (2011)
4. Cardoso, D.M., Kaminski, M., Lozin, V.: Maximum $$k$$ k -regular induced subgraphs, Rutcor Research Report (RRR) 3 (2006)
5. Cameron, K.: Induced matching. Discret. Appl. Math. 24, 97–102 (1989)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献