eBook
Parallel complexity of lexicographically first problems for tree-structured graphs
| Τίτλος: | Parallel complexity of lexicographically first problems for tree-structured graphs |
|---|---|
| Συγγραφείς: | Chlebus, BogdanAff1, Diks, KrzysztofAff1, Rytter, WojciechAff1, Szymacha, TomaszAff1 |
| Συνεισφορές: | 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 |
καταχωρήστε σχόλιο πρώτοι!