Navegar

Colección

Datos Estadísticas

Lista de

Recognition algorithms
5
"Neighborhood covering and independence on P4-tidy graphs and tree-cographs" (2017) Durán, G.; Safe, M.; Warnes, X. Annals of Operations Research:1-32
"Clique-perfectness and balancedness of some graph classes" (2014) Bonomo, F.; Durán, G.; Safe, M.D.; Wagler, A.K. International Journal of Computer Mathematics. 91(10):2118-2141
"Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs" (2009) Bonomo, F.; Chudnovsky, M.; Durán, G. Discrete Mathematics. 309(11):3485-3499
"A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs" (2008) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008. 5124 LNCS:355-366
"Characterizations and linear time recognition of helly circular-arc graphs" (2006) Lin, M.C.; Szwarcfiter, J.L. 12th Annual International Conference on Computing and Combinatorics, COCOON 2006. 4112 LNCS:73-82