Skip to main content

1 Result(s)

within Lawqueen Kanesh Remove this filter Information Systems Applications (incl. Internet) Remove this filter

and

  1. Chapter and Conference Paper

    On the Complexity of Singly Connected Vertex Deletion

    A digraph D is singly connected if for all ordered pairs of vertices \(u,v\in V(D)\) , there is at most one path in D

    Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil… in Combinatorial Algorithms (2020)

    Download PDF (428 KB) View Chapter