Fast Quasi-Threshold Editing

Cite This

Files in this item

Checksum: MD5:986f21833992f518eea9205a974cb8b6

BRANDES, Ulrik, Michael HAMANN, Ben STRASSER, Dorothea WAGNER, 2015. Fast Quasi-Threshold Editing. 23rd Annual European Symposium. Patras, Greece, Sep 14, 2015 - Sep 16, 2015. In: BANSAL, Nikhil, ed. and others. Algorithms - ESA 2015 : 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, proceedings. Berlin [u.a.]:Springer, pp. 251-262. ISBN 978-3-662-48349-7. Available under: doi: 10.1007/978-3-662-48350-3_22

@inproceedings{Brandes2015-11-12Quasi-33493, title={Fast Quasi-Threshold Editing}, year={2015}, doi={10.1007/978-3-662-48350-3_22}, number={9294}, isbn={978-3-662-48349-7}, address={Berlin [u.a.]}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={Algorithms - ESA 2015 : 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, proceedings}, pages={251--262}, editor={Bansal, Nikhil}, author={Brandes, Ulrik and Hamann, Michael and Strasser, Ben and Wagner, Dorothea} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dspace:isPartOfCollection rdf:resource=""/> <dc:contributor>Hamann, Michael</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Fast Quasi-Threshold Editing</dcterms:title> <dc:date rdf:datatype="">2016-03-30T08:46:33Z</dc:date> <dcterms:issued>2015-11-12</dcterms:issued> <dcterms:available rdf:datatype="">2016-03-30T08:46:33Z</dcterms:available> <dcterms:rights rdf:resource=""/> <dc:language>eng</dc:language> <dc:creator>Brandes, Ulrik</dc:creator> <dc:creator>Wagner, Dorothea</dc:creator> <bibo:uri rdf:resource=""/> <dcterms:hasPart rdf:resource=""/> <dspace:hasBitstream rdf:resource=""/> <dcterms:isPartOf rdf:resource=""/> <dc:contributor>Strasser, Ben</dc:contributor> <dc:creator>Hamann, Michael</dc:creator> <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 a minimum number of edge insertions and deletions. Given a graph it computes a quasi-threshold graph which is close in terms of edit count, but not necessarily closest as this edit problem is NP-hard. We present an extensive experimental study, in which we show that QTM performs well in practice and is the first heuristic 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> <dc:rights>terms-of-use</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Strasser, Ben</dc:creator> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:contributor>Wagner, Dorothea</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Mar 30, 2016 (Information about access statistics)

Brandes_0-324735.pdf 131

This item appears in the following Collection(s)

Search KOPS


My Account