eBook
The isomorphism problem is polynomially solvable for certain graph languages
| Title: | The isomorphism problem is polynomially solvable for certain graph languages |
|---|---|
| Authors: | Schnitzler, ManfredAff1 |
| 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, Ehrig, Hartmut, editor, Nagl, Manfred, editor, Rozenberg, Grzegorz, editor |
| Source: | Graph-Grammars and Their Application to Computer Science : 2nd International Workshop Haus Ohrbeck, Germany, October 4–8, 1982. 153:369-379 |
| Database: | Springer Nature eBooks |
Be the first to leave a comment!