Reachability, distance, and matching are some of the most fundamental gr...
We construct in Logspace non-zero circulations for H-minor free graphs w...
A graph separator is a subset of vertices of a graph whose removal divid...
The authors have withdrawn this paper due to an error in the proof of Le...
The reachability problem is to determine if there exists a path from one...
Reachability is the problem of deciding whether there is a path from one...
Recently, perfect matching in bounded planar cutwidth bipartite graphs
(...