A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
On the Kernel and Related Problems in Interval Digraphs
[article]
2021
arXiv
pre-print
Given a digraph G, a set X⊆ V(G) is said to be absorbing set (resp. dominating set) if every vertex in the graph is either in X or is an in-neighbour (resp. out-neighbour) of a vertex in X. A set S⊆ V(G) is said to be an independent set if no two vertices in S are adjacent in G. A kernel (resp. solution) of G is an independent and absorbing (resp. dominating) set in G. We explore the algorithmic complexity of these problems in the well known class of interval digraphs. A digraph G is an
arXiv:2107.08278v2
fatcat:x25a2rafafhcbnc5gtpm7rsyoy