Reachability is harder for directed than for undirected finite graphs | IEEE Conference Publication | IEEE Xplore