Parallel complexity of lexicographically first problems for tree-structured graphs

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	Parallel complexity of lexicographically first problems for tree-structured graphs
Συγγραφείς:	Chlebus, Bogdan^Aff1, Diks, Krzysztof^Aff1, Rytter, Wojciech^Aff1, Szymacha, Tomasz^Aff1
Συνεισφορές:	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
Πηγή:	Mathematical Foundations of Computer Science 1989 : Porabka-Kozubnik, Poland August 28 – September 1, 1989 Proceedings. 379:185-195
Βάση Δεδομένων:	Springer Nature eBooks

Περιγραφή
ISBN:	9783540514862 9783540481768
DOI:	10.1007/3-540-51486-4_66