Parallel complexity of lexicographically first problems for tree-structured graphs

Bibliographic Details
Title:	Parallel complexity of lexicographically first problems for tree-structured graphs
Authors:	Chlebus, Bogdan^Aff1, Diks, Krzysztof^Aff1, Rytter, Wojciech^Aff1, Szymacha, Tomasz^Aff1
Contributors:	Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Kreczmar, Antoni, editor, Mirkowska, Grazyna, editor
Source:	Mathematical Foundations of Computer Science 1989 : Porabka-Kozubnik, Poland August 28 – September 1, 1989 Proceedings. 379:185-195
Database:	Springer Nature eBooks

Be the first to leave a comment!