Hochschulschrift
New algorithms for distance and inclusion problems on ordered trees
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
127 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Bonn, Univ., Diss., 2001 (Nicht für den Austausch)
- Schlagwort
-
Baum
Mustervergleich
- Urheber
-
Richter, Thorsten
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:51 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Richter, Thorsten
Ähnliche Objekte (12)
Ordered tree representations of infinite graphs
Minimum distance-unbalancedness of trees
Security in Distance Vector Algorithms
Superdominance order and distance of trees
Superdominance order and distance of trees
Algorithms on trees and graphs
Gromov-Hausdorff and Interleaving distance for trees
Angle and Distance Constraints on Tree Drawings
Improving predictions of tree structured algorithms
Optimally Ordered Orthogonal Neighbor Joining Trees for Hierarchical Cluster Analysis
Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations
Complementation and Inclusion of Weighted Automata on Infinite Trees
Ordered tree representations of infinite graphs
Minimum distance-unbalancedness of trees
Security in Distance Vector Algorithms
Superdominance order and distance of trees
Superdominance order and distance of trees
Algorithms on trees and graphs
Gromov-Hausdorff and Interleaving distance for trees
Angle and Distance Constraints on Tree Drawings
Improving predictions of tree structured algorithms
Optimally Ordered Orthogonal Neighbor Joining Trees for Hierarchical Cluster Analysis
Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations
Complementation and Inclusion of Weighted Automata on Infinite Trees
Ordered tree representations of infinite graphs
Minimum distance-unbalancedness of trees
Security in Distance Vector Algorithms
Superdominance order and distance of trees
Superdominance order and distance of trees
Algorithms on trees and graphs
Gromov-Hausdorff and Interleaving distance for trees
Angle and Distance Constraints on Tree Drawings
Improving predictions of tree structured algorithms
Optimally Ordered Orthogonal Neighbor Joining Trees for Hierarchical Cluster Analysis
Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations