Close
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
jump to main content
Search Details
Quicksearch:
OK
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
The complexity of embedding graphs into binary trees
Author
Monien, Burkhard
Is part of
Fundamentals of computation theory, Berlin [u.a.], 1985, page 300-309
Place and Date of Creation
2009
Language
English
Document Types
Article in a collected edition
ISBN
3-540-15689-5
URN
urn:nbn:de:hbz:466:2-4408
Links
Social Media
Share
Reference
Universitätsbibliothek Paderborn
IIIF
IIIF Manifest
Files
The complexity of embedding graphs into binary trees
[
Pdf
0.42 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
225
times.
License/Rightsstatement
In Copyright
The search-operation requires javascript to be activated.
