DSpace Repository

Finding isomorphism between RDF graphs

Show simple item record

dc.contributor.author Sithu Naing en_US
dc.date.accessioned 2015-01-12T10:39:57Z
dc.date.available 2015-01-12T10:39:57Z
dc.identifier.other AIT Thesis no.CS-03-04 en_US
dc.identifier.uri http://www.cs.ait.ac.th/xmlui/handle/123456789/273
dc.description Pathum Thani, Thailand : Asian Institute of Technology, 2003 en_US
dc.description 36 p. en_US
dc.description.abstract Resource Description Framework (RDF) recommended by the World Wide Web Consortium , is to model meta-data about the resources of the web. RDF is a fundamental lower layer of the semantic web. It describes graphs of statements about resources. Within RDF graphs, anonymous resources are considered as unlabell ed in a graph. In this thesis, find out the equality of RDF graphs and traditional graphs. And show that Interactive vertex classification algorithm which is a standard graph isomorphism algorithm can be applied to check the isomorphic between RDF graphs effectively .
dc.relation.ispartof Thesis no. CS-03-04 en_US
dc.relation.ispartof Asian Institute of Technology. Thesis no. CS-03-04 en_US
dc.subject Isomorphisms (Mathematics) en_US
dc.subject Metadata en_US
dc.title Finding isomorphism between RDF graphs en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account