eBook
The isomorphism problem is polynomially solvable for certain graph languages
| Τίτλος: | The isomorphism problem is polynomially solvable for certain graph languages |
|---|---|
| Συγγραφείς: | Schnitzler, ManfredAff1 |
| Συνεισφορές: | 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, Ehrig, Hartmut, editor, Nagl, Manfred, editor, Rozenberg, Grzegorz, editor |
| Πηγή: | Graph-Grammars and Their Application to Computer Science : 2nd International Workshop Haus Ohrbeck, Germany, October 4–8, 1982. 153:369-379 |
| Βάση Δεδομένων: | Springer Nature eBooks |
καταχωρήστε σχόλιο πρώτοι!