On best transitive approximations to simple graphs
| dc.contributor.author | Delvaux, Steven | |
| dc.contributor.author | Horsten, Leon | |
| dc.date.accessioned | 2022-03-22T10:18:14Z | |
| dc.date.available | 2022-03-22T10:18:14Z | |
| dc.date.issued | 2004 | eng |
| dc.description.abstract | 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. | eng |
| dc.description.version | published | eng |
| dc.identifier.doi | 10.1007/s00236-004-0144-0 | eng |
| dc.identifier.ppn | 1797603841 | |
| dc.identifier.uri | https://kops.uni-konstanz.de/handle/123456789/56938 | |
| dc.language.iso | eng | eng |
| dc.rights | terms-of-use | |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
| dc.subject.ddc | 100 | eng |
| dc.title | On best transitive approximations to simple graphs | eng |
| dc.type | JOURNAL_ARTICLE | eng |
| dspace.entity.type | Publication | |
| kops.citation.bibtex | @article{Delvaux2004trans-56938,
year={2004},
doi={10.1007/s00236-004-0144-0},
title={On best transitive approximations to simple graphs},
volume={40},
issn={0001-5903},
journal={Acta Informatica},
pages={637--655},
author={Delvaux, Steven and Horsten, Leon}
} | |
| kops.citation.iso690 | DELVAUX, Steven, Leon HORSTEN, 2004. On best transitive approximations to simple graphs. In: Acta Informatica. Springer. 2004, 40, pp. 637-655. ISSN 0001-5903. eISSN 1432-0525. Available under: doi: 10.1007/s00236-004-0144-0 | deu |
| kops.citation.iso690 | DELVAUX, Steven, Leon HORSTEN, 2004. On best transitive approximations to simple graphs. In: Acta Informatica. Springer. 2004, 40, pp. 637-655. ISSN 0001-5903. eISSN 1432-0525. Available under: doi: 10.1007/s00236-004-0144-0 | eng |
| 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/56938">
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56938/3/Delvaux_2-54lxjia8sox51.pdf"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-22T10:18:14Z</dc:date>
<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>
<dcterms:title>On best transitive approximations to simple graphs</dcterms:title>
<dc:language>eng</dc:language>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56938"/>
<dc:creator>Delvaux, Steven</dc:creator>
<dc:creator>Horsten, Leon</dc:creator>
<dc:contributor>Delvaux, Steven</dc:contributor>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56938/3/Delvaux_2-54lxjia8sox51.pdf"/>
<dc:contributor>Horsten, Leon</dc:contributor>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-22T10:18:14Z</dcterms:available>
<dcterms:issued>2004</dcterms:issued>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
<dc:rights>terms-of-use</dc:rights>
</rdf:Description>
</rdf:RDF> | |
| kops.description.openAccess | openaccessgreen | |
| kops.flag.isPeerReviewed | unknown | eng |
| kops.flag.knbibliography | false | |
| kops.identifier.nbn | urn:nbn:de:bsz:352-2-54lxjia8sox51 | |
| kops.sourcefield | Acta Informatica. Springer. 2004, <b>40</b>, pp. 637-655. ISSN 0001-5903. eISSN 1432-0525. Available under: doi: 10.1007/s00236-004-0144-0 | deu |
| kops.sourcefield.plain | Acta Informatica. Springer. 2004, 40, pp. 637-655. ISSN 0001-5903. eISSN 1432-0525. Available under: doi: 10.1007/s00236-004-0144-0 | deu |
| kops.sourcefield.plain | Acta Informatica. Springer. 2004, 40, pp. 637-655. ISSN 0001-5903. eISSN 1432-0525. Available under: doi: 10.1007/s00236-004-0144-0 | eng |
| relation.isAuthorOfPublication | 7a655380-a594-49b4-a5bb-d3a6adc1f18a | |
| relation.isAuthorOfPublication.latestForDiscovery | 7a655380-a594-49b4-a5bb-d3a6adc1f18a | |
| source.bibliographicInfo.fromPage | 637 | eng |
| source.bibliographicInfo.toPage | 655 | eng |
| source.bibliographicInfo.volume | 40 | eng |
| source.identifier.eissn | 1432-0525 | eng |
| source.identifier.issn | 0001-5903 | eng |
| source.periodicalTitle | Acta Informatica | eng |
| source.publisher | Springer | eng |
Dateien
Originalbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- Delvaux_2-54lxjia8sox51.pdf
- Größe:
- 155.89 KB
- Format:
- Adobe Portable Document Format
- Beschreibung:
Lizenzbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- license.txt
- Größe:
- 3.96 KB
- Format:
- Item-specific license agreed upon to submission
- Beschreibung:
