logo biblio digital exactas
logo twitter logo instagram logo whatsapp logo mail

Navegar

Colección

Datos Estadísticas

Lista de

NP-completeness
7
"Perfect edge domination: hard and solvable cases" (2018) Lin, M.C.; Lozin, V.; Moyano, V.A.; Szwarcfiter, J.L. Annals of Operations Research. 264(1-2):287-305
"Decidability of order-based modal logics" (2017) Caicedo, X.; Metcalfe, G.; Rodríguez, R.; Rogger, J. Journal of Computer and System Sciences. 88:53-74
"Complexity of the cluster deletion problem on subclasses of chordal graphs" (2015) Bonomo, F.; Durán, G.; Valencia-Pabon, M. Theoretical Computer Science. 600:59-69
"Complexity of the cluster deletion problem on subclasses of chordal graphs" (2015) Bonomo, F.; Durán, G.; Valencia-Pabon, M. Theoretical Computer Science. 600:59-69
"Alloy+HotCore: A fast approximation to unsat core" (2010) D'Ippolito, N.;Frias, M.F.;Galeotti, J.P. (...)Mera, S. 2nd International Conference on Abstract State Machines, Alloy, B and Z, ABZ 2010. 5977 LNCS:160-173
"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844
"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844