On best transitive approximations to simple graphs

Cite This

Files in this item

Checksum: MD5:7f9d2f657a613e4bcf57413170662146

DELVAUX, Steven, Leon HORSTEN, 2004. On best transitive approximations to simple graphs. In: Acta Informatica. Springer. 40, pp. 637-655. ISSN 0001-5903. eISSN 1432-0525. Available under: doi: 10.1007/s00236-004-0144-0

@article{Delvaux2004trans-56938, title={On best transitive approximations to simple graphs}, year={2004}, doi={10.1007/s00236-004-0144-0}, volume={40}, issn={0001-5903}, journal={Acta Informatica}, pages={637--655}, author={Delvaux, Steven and Horsten, Leon} }

<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/rdf/resource/123456789/56938"> <dc:contributor>Delvaux, Steven</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56938/3/Delvaux_2-54lxjia8sox51.pdf"/> <dcterms:title>On best transitive approximations to simple graphs</dcterms:title> <dcterms:issued>2004</dcterms:issued> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Horsten, Leon</dc:creator> <dc:rights>terms-of-use</dc:rights> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-22T10:18:14Z</dc:date> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:creator>Delvaux, Steven</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Horsten, Leon</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56938/3/Delvaux_2-54lxjia8sox51.pdf"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56938"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-22T10:18:14Z</dcterms:available> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:abstract xml:lang="eng">In this paper, we investigate both combinatorial and complexity aspects of the problem of finding best transitive approximations to simple graphs. These problems are addressed in an interlocked way. We provide new and simple proofs of known results and in addition prove some new theorems.</dcterms:abstract> </rdf:Description> </rdf:RDF>

Downloads since Mar 22, 2022 (Information about access statistics)

Delvaux_2-54lxjia8sox51.pdf 13

This item appears in the following Collection(s)

Search KOPS


Browse

My Account