The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
The algorithm design manual
Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
International Journal of Web Engineering and Technology
Peer-to-peer semantic coordination
Web Semantics: Science, Services and Agents on the World Wide Web
Web Semantics: Science, Services and Agents on the World Wide Web
On the foundations of computing deltas between RDF models
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Matching hierarchical classifications with attributes
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Soundness of schema matching methods
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Replication and versioning of partial RDF graphs
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Pay-as-you-go data integration for linked data: opportunities, challenges and architectures
SWIM '12 Proceedings of the 4th International Workshop on Semantic Web Information Management
Blank node matching and RDF/S comparison functions
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
| Hi-index | 0.00 |
The Resource Description Framework (RDF) describes graphs of statements about resources. RDF is a fundamental lower layer of the semantic web. This paper explores the equality of two RDF graphs in light of the graph isomorphism literature. We consider anonymous resources as unlabelled vertices in a graph, and show that the standard graph isomorphism algorithms, developed in the 1970's, can be used effectively for comparing RDF graphs. The techniques presented are useful for testing RDF software.