<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Finding isomorphism between RDF graphs</title>
  </titleInfo>
  <name type="personal">
    <namePart>Sithu Naing</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Sadananda, R.</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Guha, Sumanta</namePart>
    <role>
      <roleTerm type="text">Examination Committee </roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Aekavut Sujarae</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Partial Scholarship Asian Institute of Technology</namePart>
    <role>
      <roleTerm type="text">Scholarship Donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">series</genre>
  <genre authority="marc">technical report</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Pathum Thani, Thailand</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>2003</dateIssued>
    <issuance>continuing</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>36 p.</extent>
  </physicalDescription>
  <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 unlabelled 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.</abstract>
  <note>A thesis study submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies</note>
  <note>Thesis (M.Sc.) - Asian Institute of Technology, 2003</note>
  <subject authority="lcsh">
    <topic>Isomorphisms (Mathematics)</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Metadata</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. CS-03-04</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri"> http://203.159.5.9/ait-thesis/detail.php?q=B11526</identifier>
  <location>
    <url displayLabel="Full-Text"> http://203.159.5.9/ait-thesis/detail.php?q=B11526</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">040723</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818113837.0</recordChangeDate>
  </recordInfo>
</mods>
