Close
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
jump to main content
Search Details
Quicksearch:
OK
Result-List
Title
Title
Content
Content
Page
Page
The search-operation requires javascript to be activated.
The search-operation requires javascript to be activated.
The search-operation requires javascript to be activated.
Bibliographic Metadata
Title
How to find long paths efficiently
Author
Monien, Burkhard
Is part of
Annals of Discrete Mathematics, Amsterdam, 1985, Vol. 25.1985, page 239-254
Place and Date of Creation
2009
Language
English
Document Types
Journal Article
ISSN
0167-5060
URN
urn:nbn:de:hbz:466:2-4393
Links
Social Media
Share
Reference
Universitätsbibliothek Paderborn
IIIF
IIIF Manifest
Files
How to find long paths efficiently
[
pdf
0.63 mb
]
RIS
Classification
Besondere Sammlungen
→
Veröffentlichungen der Universität
→
Fakultät für Elektrotechnik, Informatik und Mathematik
→
Institut für Informatik
Klassifikation (DDC)
→
Informatik, Informationswissenschaft, allgemeine Werke
→
Informatik, Wissen, Systeme
→
Informatik, Informationswissenschaft, allgemeine Werke
Content
Contents of this Book
Stats
The PDF-Document has been downloaded
349
times.
License/Rightsstatement
In Copyright
The search-operation requires javascript to be activated.
