Your search also matched
13
preview-only
Content is preview-only when you or your institution have not yet subscribed to it.
By making our abstracts and previews universally accessible we help you purchase only the content that is relevant to you.
results, e.g.
Include preview-only content
-
Chapter and Conference Paper
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)