Searching for "Reachability Is Harder for Directed than for Undirected Finite Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Reachability is harder for directed than for undirected finite graphs
by Miklos Ajtai, Ronald Fagin — 1990 — Journal of Symbolic Logic
… is harder for directed graphs than for undirected graphs. We prove that, in a certain precise sense…
Cited by 70 (9 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB