Publikation: Eager st-Ordering
Lade...
Dateien
Datum
2002
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
MÖHRING, Rolf, ed., Rajeev RAMAN, ed.. Algorithms — ESA 2002. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002, pp. 247-256. Lecture Notes in Computer Science. 2461. ISBN 978-3-540-44180-9. Available under: doi: 10.1007/3-540-45749-6_25
Zusammenfassung
Given a biconnected graph G = (V,E) with edge {s, t} gehört E, an st-ordering is an ordering v1, . . . , vn of V such that s = v1, t = vn, and every other vertex has both a higher-numbered and a lower-numbered neighbor. Previous linear-time st-ordering algorithms are based on a preprocessing step in which depth-first search is used to compute lowpoints. The actual ordering is determined only in a second pass over the graph. We present a new, incremental algorithm that does not require lowpoint information and, throughout a single depth-first traversal, maintains an st-ordering of the biconnected component of {s, t} in the traversed subgraph.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
BRANDES, Ulrik, 2002. Eager st-Ordering. In: MÖHRING, Rolf, ed., Rajeev RAMAN, ed.. Algorithms — ESA 2002. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002, pp. 247-256. Lecture Notes in Computer Science. 2461. ISBN 978-3-540-44180-9. Available under: doi: 10.1007/3-540-45749-6_25BibTex
@inproceedings{Brandes2002-08-29Eager-5862,
year={2002},
doi={10.1007/3-540-45749-6_25},
title={Eager st-Ordering},
number={2461},
isbn={978-3-540-44180-9},
publisher={Springer Berlin Heidelberg},
address={Berlin, Heidelberg},
series={Lecture Notes in Computer Science},
booktitle={Algorithms — ESA 2002},
pages={247--256},
editor={Möhring, Rolf and Raman, Rajeev},
author={Brandes, Ulrik}
}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/5862">
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:creator>Brandes, Ulrik</dc:creator>
<dc:language>eng</dc:language>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:45Z</dc:date>
<dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:issued>2002-08-29</dcterms:issued>
<dc:contributor>Brandes, Ulrik</dc:contributor>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5862"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5862/1/b_esto_02.pdf"/>
<dcterms:title>Eager st-Ordering</dcterms:title>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5862/1/b_esto_02.pdf"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:45Z</dcterms:available>
<dcterms:bibliographicCitation>First publ. in: Proceedings of the 10th European Symposium Algorithms (ESA ´02) (LNCS 2461), 2002, pp. 247-256</dcterms:bibliographicCitation>
<dc:format>application/pdf</dc:format>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
<dcterms:abstract xml:lang="eng">Given a biconnected graph G = (V,E) with edge {s, t} gehört E, an st-ordering is an ordering v1, . . . , vn of V such that s = v1, t = vn, and every other vertex has both a higher-numbered and a lower-numbered neighbor. Previous linear-time st-ordering algorithms are based on a preprocessing step in which depth-first search is used to compute lowpoints. The actual ordering is determined only in a second pass over the graph. We present a new, incremental algorithm that does not require lowpoint information and, throughout a single depth-first traversal, maintains an st-ordering of the biconnected component of {s, t} in the traversed subgraph.</dcterms:abstract>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
