@inproceedings{Berthold1998Effic-24292,
  year={1998},
  doi={10.1109/NAFIPS.1998.715566},
  title={Efficiently Comparing Fuzzy Graphs},
  isbn={0-7803-4453-7},
  publisher={IEEE},
  booktitle={1998 Conference of the North American Fuzzy Information Processing Society - NAFIPS (Cat. No.98TH8353)},
  pages={208--211},
  author={Berthold, Michael R. and Huber, Klaus-Peter}
}

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/24292">
    <dcterms:bibliographicCitation>1998 Conference of the North American Fuzzy Information Processing Society - NAFIPS : August 20 &amp; 21, 1998, Pensacola Beach, Florida, USA / ed. by Jim Bezdek, Lawrence O. Hall. - Piscataway, NJ : IEEE Service Center, 1998. - S. 208-211. - ISBN 0-7803-4453-7</dcterms:bibliographicCitation>
    <dc:creator>Huber, Klaus-Peter</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>1998</dcterms:issued>
    <dc:language>eng</dc:language>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">The paper investigates techniques for comparing two fuzzy graphs. Fuzzy graphs are attracting attention because they not only allow easy interpretation but in addition finding regions of interest or tolerating missing attributes can be done computationally in a very efficient manner. This is of great interest in numerous applications such as intelligent data analysis, meta-modeling and others. Two ways of comparing fuzzy graphs are presented.</dcterms:abstract>
    <dcterms:title>Efficiently Comparing Fuzzy Graphs</dcterms:title>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24292"/>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-22T08:24:16Z</dcterms:available>
    <dc:contributor>Huber, Klaus-Peter</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-22T08:24:16Z</dc:date>
  </rdf:Description>
</rdf:RDF>