Author:
Chang Maw-Shang,Hung Ling-Ju,Miau Chau-An
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. 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
–barrier for irredundance: two lines of attack. Journal of Discrete Algorithms 9, 214–230 (2011)
2. Cardoso, D.M., Kaminski, M., Lozin, V.: Maximum k-Regular Induced Subgraphs. Rutcor Research Report (RRR) 3 (2006)
3. Cameron, K.: Induced matching. Discrete Applied Mathematics 24, 97–102 (1989)
4. Cameron, K., Sritharan, R., Tang, Y.: Finding a maximum induced matching in weakly chordal graphs. Discrete Mathematics 266, 133–142 (2003)
5. Duckworth, W., Manlove, D.F., Zito, M.: On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms 3, 79–91 (2005)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximum Induced Matching of Hexagonal Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2015-12-14