1 paper · 1 filter
Teresa I. Hoekstra-Mendoza, Miguel E. Licona-Velázquez, Rocío Rojas-Monroy
It is well known that determining if a digraph has a kernel is an NP-complete problem. However, Topp proved that when subdividing every arc of a digraph we obtain a digraph with a…