Fast Quasi-Threshold Editing

Kurzanzeige
dc.contributor.authorBrandes, Ulrik
dc.contributor.authorHamann, Michael
dc.contributor.authorStrasser, Ben
dc.contributor.authorWagner, Dorothea
dc.date.accessioned2015-06-03T09:26:06Z
dc.date.available2015-06-03T09:26:06Z
dc.date.issued2015eng
dc.description.abstractWe introduce Quasi-Threshold Mover (QTM), an algorithm to solve the quasi-threshold (also called trivially perfect) graph editing problem with edge insertion and deletion. Given a graph it computes a quasi-threshold graph which is close in terms of edit count. This edit problem is NP-hard. We present an extensive experimental study, in which we show that QTM is the first algorithm that is able to scale to large real-world graphs in practice. As a side result we further present a simple linear-time algorithm for the quasi-threshold recognition problem.eng
dc.description.versionpublished
dc.identifier.arxiv1504.07379
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/31115
dc.language.isoengeng
dc.subjectData Structures and Algorithms, Social and Information Networks, Physics and Societyeng
dc.subject.ddc004eng
dc.titleFast Quasi-Threshold Editingeng
dc.typePREPRINTeng
dspace.entity.typePublication
kops.citation.bibtex
@unpublished{Brandes2015Quasi-31115,
  year={2015},
  title={Fast Quasi-Threshold Editing},
  author={Brandes, Ulrik and Hamann, Michael and Strasser, Ben and Wagner, Dorothea}
}
kops.citation.iso690BRANDES, Ulrik, Michael HAMANN, Ben STRASSER, Dorothea WAGNER, 2015. Fast Quasi-Threshold Editingdeu
kops.citation.iso690BRANDES, Ulrik, Michael HAMANN, Ben STRASSER, Dorothea WAGNER, 2015. Fast Quasi-Threshold Editingeng
kops.citation.rdf
<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/31115">
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:creator>Hamann, Michael</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dc:contributor>Strasser, Ben</dc:contributor>
    <dcterms:abstract xml:lang="eng">We introduce Quasi-Threshold Mover (QTM), an algorithm to solve the quasi-threshold (also called trivially perfect) graph editing problem with edge insertion and deletion. Given a graph it computes a quasi-threshold graph which is close in terms of edit count. This edit problem is NP-hard. We present an extensive experimental study, in which we show that QTM is the first algorithm that is able to scale to large real-world graphs in practice. As a side result we further present a simple linear-time algorithm for the quasi-threshold recognition problem.</dcterms:abstract>
    <dcterms:issued>2015</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Hamann, Michael</dc:contributor>
    <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">2015-06-03T09:26:06Z</dcterms:available>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/31115"/>
    <dcterms:title>Fast Quasi-Threshold Editing</dcterms:title>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-06-03T09:26:06Z</dc:date>
    <dc:creator>Strasser, Ben</dc:creator>
  </rdf:Description>
</rdf:RDF>
kops.flag.knbibliographytrue
relation.isAuthorOfPublicationfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
relation.isAuthorOfPublication.latestForDiscoveryfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
temp.internal.duplicates<p>Keine Dubletten gefunden. Letzte Überprüfung: 06.05.2015 13:39:36</p>deu

Dateien

Sammlungen

Informatik und Informationswissenschaft: Publikationen