@inproceedings{Frank2012Compl-66695,
  year={2012},
  title={Complexity of Families of Multigraphs},
  url={http://mrs.schochastics.net/publications/complexity_multigraphs/JSM2012.pdf},
  isbn={978-0-9839375-2-4},
  publisher={American Statistical Association},
  address={Alexandria, Va.},
  booktitle={2012 JSM Proceedings : Papers Presented at the Joint Statistical Meetings},
  pages={2908--2921},
  author={Frank, Ove and Shafie, Termeh}
}

<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/66695">
    <dc:contributor>Shafie, Termeh</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-04-20T11:02:24Z</dc:date>
    <dc:creator>Shafie, Termeh</dc:creator>
    <dcterms:issued>2012</dcterms:issued>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/66695"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-04-20T11:02:24Z</dcterms:available>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Frank, Ove</dc:contributor>
    <dcterms:abstract>This article describes families of finite multigraphs with labeled or unlabeled edges and vertices. It shows how size and complexity vary for different types of equivalence classes of graphs defined by ignoring only edge labels or ignoring both edge and vertex labels. Complexity is quantified by the distribution of edge multiplicities, and different complexity measures are discussed. Basic occupancy models for multigraphs are used to illustrate different graph distributions on isomorphism and complexity. The loss of information caused by ignoring edge and vertex labels is quantified by entropy and joint information that provide tools for studying properties of and relations between different graph families.</dcterms:abstract>
    <dcterms:title>Complexity of Families of Multigraphs</dcterms:title>
    <dc:language>eng</dc:language>
    <dc:creator>Frank, Ove</dc:creator>
  </rdf:Description>
</rdf:RDF>