Eager st-Ordering

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:40590ae51daabfd077fc1028c3e7a809

BRANDES, Ulrik, 2002. Eager st-Ordering. In: MÖHRING, Rolf, ed., Rajeev RAMAN, ed.. Algorithms — ESA 2002. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 247-256. ISBN 978-3-540-44180-9

@inproceedings{Brandes2002-08-29Eager-5862, title={Eager st-Ordering}, year={2002}, doi={10.1007/3-540-45749-6_25}, number={2461}, isbn={978-3-540-44180-9}, address={Berlin, Heidelberg}, publisher={Springer 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 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5862"> <dc:creator>Brandes, Ulrik</dc:creator> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:45Z</dc:date> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 10th European Symposium Algorithms (ESA ´02) (LNCS 2461), 2002, pp. 247-256</dcterms:bibliographicCitation> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5862"/> <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> <dc:rights>deposit-license</dc:rights> <dcterms:issued>2002-08-29</dcterms:issued> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:45Z</dcterms:available> <dc:format>application/pdf</dc:format> <dcterms:title>Eager st-Ordering</dcterms:title> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

b_esto_02.pdf 53

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto