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 | 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 coAdd to Reading ListSource URL: aidanhogan.comDownload Document from Source WebsiteFile Size: 1,39 MBShare Document on Facebook |
CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS STRUCTURE AND COMPLEXITYDocID: 1r79Q - View Document | |
The homomorphism order Constrained homomorphisms Locally constrained homomorphism orders Constrained homomorphism orders Jan HubiˇckaDocID: 1r6wl - View Document | |
Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel PaulusmaDocID: 1r6iz - View Document | |
CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS LOCALLY INJECTIVE HOMOMORPHISMSDocID: 1r5we - View Document | |
A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir DaneshgarDocID: 1r2yt - View Document |