Sort by: Order: Results:

  • E S, AJAYKRISHNAN (2023-05)
    A knot K in a directed graph D = (V, E) is a strongly connected subgraph of D with at least two vertices, such that there is no arc (u, v) of D with u in V (K) and v not in V (K). Given a directed graph D = (V, E), we study ...