Zusammenfassung
Wir betrachten zunächst ungerichtete, endliche, schlichte Graphen.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Literaturhinweis
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974
S. Even, Graph Algorithms, Computer Science Press, 1979
K. Mehlhorn, Graph Algorithms and NP-Completeness (Band 2 von: Data Structures and Algorithms), Springer-Verlag, 1984
D.E. Knuth, Fundamental Algorithms, Band 1 von: The Art of Computer Programming, Addison-Wesley, 1968, (2. Ausgabe 1973 )
T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, MIT Press - McGraw Hill, 1990
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 B. G. Teubner Stuttgart
About this chapter
Cite this chapter
Brandstädt, A. (1994). Durchsuchen von Graphen — Knotenreihenfolgen von Graphen. In: Graphen und Algorithmen. Leitfäden und Monographien der Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-94689-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-322-94689-8_3
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-519-02131-5
Online ISBN: 978-3-322-94689-8
eBook Packages: Springer Book Archive