"Reachability Is Harder for Directed than for Undirected Finite Graphs."

Miklós Ajtai, Ronald Fagin (1990)

Details and statistics

DOI: 10.2307/2274958

access: closed

type: Journal Article

metadata version: 2017-05-28

a service of  Schloss Dagstuhl - Leibniz Center for Informatics