Reachability is harder for directed than for undirected finite graphs

Publisher: Cambridge University Press

E-ISSN: 1943-5886|55|1|113-150

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.55, Iss.1, 1990-03, pp. : 113-150

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract