## Reachability is harder for directed than for undirected finite graphs (1990)

### Cached

### Download Links

- [www.almaden.ibm.com]
- [researcher.watson.ibm.com]
- DBLP

### Other Repositories/Bibliography

by
Miklos Ajtai
,
Ronald Fagin

Venue: | Journal of Symbolic Logic |

Citations: | 77 - 6 self |