Reachability is harder for directed than for undirected finite graphs (Q3489984)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability is harder for directed than for undirected finite graphs |
scientific article |
Statements
Reachability is harder for directed than for undirected finite graphs (English)
0 references
1990
0 references
existential monadic second-order sentence
0 references
reachability problem
0 references
undirected reachability
0 references
Ehrenfeucht-Fraïssé games
0 references
0 references
