Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract).

Bogdan S. Chlebus Krzysztof Diks Wojciech Rytter Tomasz Szymacha Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). 185-195 1989 conf/mfcs/1989 MFCS db/conf/mfcs/mfcs89.html#ChlebusDRS89 http://dx.doi.org/10.1007/3-540-51486-4_66