Burzyn, P., Bonomo, F., & Durán, G. Computational complexity of edge modification problems in different classes of graphs.
Cita Chicago Style (17a ed.)Burzyn, P., F. Bonomo, y G. Durán. Computational Complexity of Edge Modification Problems in Different Classes of Graphs.
Cita MLA (8a ed.)Burzyn, P., et al. Computational Complexity of Edge Modification Problems in Different Classes of Graphs.
Precaución: Estas citas no son 100% exactas.