Navegar

Colección

Datos Estadísticas

Lista de

Graph algorithms
8
"Approximating weighted neighborhood independent sets" (2018) Lin, M.C.; Mestre, J.; Vasiliev, S. Information Processing Letters. 130:11-15
"Approximating weighted neighborhood independent sets" (2018) Lin, M.C.; Mestre, J.; Vasiliev, S. Information Processing Letters. 130:11-15
"A faster algorithm for the cluster editing problem on proper interval graphs" (2015) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Information Processing Letters. 115(12):913-916
"A faster algorithm for the cluster editing problem on proper interval graphs" (2015) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Information Processing Letters. 115(12):913-916
"On extending de Bruijn sequences" (2011) Becher, V.; Heiber, P.A. Information Processing Letters. 111(18):930-932
"On extending de Bruijn sequences" (2011) Becher, V.; Heiber, P.A. Information Processing Letters. 111(18):930-932
"Polynomial time recognition of unit circular-arc graphs" (2006) Durán, G.;Gravano, A.;McConnell, R.M. (...)Tucker, A. Journal of Algorithms. 58(1):67-78
"Polynomial time recognition of unit circular-arc graphs" (2006) Durán, G.;Gravano, A.;McConnell, R.M. (...)Tucker, A. Journal of Algorithms. 58(1):67-78