<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2018-05-22 02:32:06Graph theory Mathematics Semantic Web Discrete mathematics Morphisms Resource Description Framework Graph operations Blank node Graph isomorphism Graph homomorphism Cograph RDF Schema |
Add to Reading List |
Canonical Forms for Isomorphic and Equivalent RDF Graphs: Algorithms for Leaning and Labelling Blank Nodes AIDAN HOGAN, Center for Semantic Web Research, DCC, University of Chile, Chile Existential blank nodes greatly co![3. STRUCTURE MODEL AND ISOMORPHISM PROBLEM Structure model is also a canonical presentation of a graph. The problem of canonical presentation was established probably by Lazlo Babai [1, 2] in 1977th. It means the presen](https://www.pdfsearch.io/img/59411b6ffada09e286a2a1cc3c464704.jpg "3. STRUCTURE MODEL AND ISOMORPHISM PROBLEM Structure model is also a canonical presentation of a graph. The problem of canonical presentation was established probably by Lazlo Babai [1, 2] in 1977th. It means the presen")
![Graph Isomorphism in Quasipolynomial Time L´aszl´o Babai University of Chicago arXiv:1512.03547v1 [cs.DS] 11 Dec 2015](https://www.pdfsearch.io/img/4b5f78df8c378c5e3290600789f2492f.jpg "Graph Isomorphism in Quasipolynomial Time L´aszl´o Babai University of Chicago arXiv:1512.03547v1 [cs.DS] 11 Dec 2015")
