共 21 条
[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 2n-barrier for irredundance: Two lines of attack, Journal of Discrete Algorithms, 9, pp. 214-230, (2011)
[2]
Cardoso D.M., Kaminski M., Lozin V., Maximum k-Regular Induced Subgraphs, Rutcor Research Report (RRR), (2006)
[3]
Cameron K., Induced matching, Discrete Applied Mathematics, 24, pp. 97-102, (1989)
[4]
Cameron K., Sritharan R., Tang Y., Finding a maximum induced matching in weakly chordal graphs, Discrete Mathematics, 266, pp. 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, pp. 79-91, (2005)
[6]
Erman R., Kowalik L., Krnc M., Walen T., Improved induced matching in sparse graphs, Discrete Applied Mathematics, 158, pp. 1994-2003, (2010)
[7]
Fomin F.V., Kratsch D., Exact Exponential Algorithms, (2010)
[8]
Fricke G., Laskar R., String matching in trees, Congressum Numeratium, 89, pp. 239-243, (1992)
[9]
Gupta S., Raman V., Saurabh S., Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems, FSTTCS 2006. LNCS, 4337, pp. 139-151, (2006)
[10]
Hosono K., Induced forests in trees and outerplanar graphs, Proceedings of the Faculty of Science of Tokai University, 25, pp. 27-29, (1990)