Hochschulschrift
Treelike and Chordal Graphs: Algorithms and Generalizations
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Augsburg, Universität Augsburg, Diss., 2010
- Schlagwort
-
Graphentheorie
Baumweite
Approximationsalgorithmus
NP-hartes Problem
Planarer Graph
Divide-and-conquer-Verfahren
- Ereignis
-
Veröffentlichung
- (wo)
-
Augsburg
- (wer)
-
Universität Augsburg
- (wann)
-
2012
- Urheber
- Beteiligte Personen und Organisationen
-
Hagerup, Torben
- URN
-
urn:nbn:de:bvb:384-opus-18365
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:47 MEZ
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
- Kammer, Frank
- Hagerup, Torben
- Universität Augsburg
Entstanden
- 2012
Ähnliche Objekte (12)
Derivation of graph and pointer algorithms
Derivation of graph and pointer algorithms
Algebraic calculation of graph and sorting algorithms
Algebraic calculation of graph and sorting algorithms
Declarative Graph Algorithms via Knuth-Bendix Completion
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Approximation algorithms for intersection graphs
Item response models for count data : Generalizations and estimation algorithms
Space-efficient Basic Graph Algorithms
Graphs, networks and algorithms
Derivation of graph and pointer algorithms
Derivation of graph and pointer algorithms
Algebraic calculation of graph and sorting algorithms
Algebraic calculation of graph and sorting algorithms
Declarative Graph Algorithms via Knuth-Bendix Completion
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Approximation algorithms for intersection graphs
Item response models for count data : Generalizations and estimation algorithms
Space-efficient Basic Graph Algorithms
Graphs, networks and algorithms
Derivation of graph and pointer algorithms
Derivation of graph and pointer algorithms
Algebraic calculation of graph and sorting algorithms
Algebraic calculation of graph and sorting algorithms
Declarative Graph Algorithms via Knuth-Bendix Completion
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Shorter paths to graph algorithms
Approximation algorithms for intersection graphs
Item response models for count data : Generalizations and estimation algorithms
Space-efficient Basic Graph Algorithms