Menu
A kernel in a directed graph \(D(V, E)\) is a set \(S\) of vertices of \(D\) such that no two vertices in \(S\) are adjacent and for every vertex \(u\) in \(V \setminus S\) there is a vertex \(v\) in \(S\) such that \((u, v)\) is an arc of \(D\). The problem of existence of a kernel itself is NP-complete for a general digraph. But in this paper, we solve the strong kernel problem of certain oriented networks in polynomial time.