Hochschulschrift

Treelike and Chordal Graphs: Algorithms and Generalizations

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: Augsburg, Universität Augsburg, Diss., 2010

Keyword: Graphentheorie
Baumweite
Approximationsalgorithmus
NP-hartes Problem
Planarer Graph
Divide-and-conquer-Verfahren

Event: Veröffentlichung

(where): Augsburg

(who): Universität Augsburg

(when): 2012

Creator: Kammer, Frank

Contributor: Hagerup, Torben

URN: urn:nbn:de:bvb:384-opus-18365

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 25.03.2025, 1:47 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Object type

Hochschulschrift

Associated

Kammer, Frank
Hagerup, Torben
Universität Augsburg

Time of origin

2012

Other Objects (12)

Derivation of graph and pointer algorithms

Algebraic calculation of graph and sorting algorithms

Declarative Graph Algorithms via Knuth-Bendix Completion

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

Algebraic calculation of graph and sorting algorithms

Declarative Graph Algorithms via Knuth-Bendix Completion

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

Algebraic calculation of graph and sorting algorithms

Declarative Graph Algorithms via Knuth-Bendix Completion

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

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Treelike and Chordal Graphs: Algorithms and Generalizations

Object Details

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Object type

Associated

Time of origin

Other Objects (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

Graphs, networks and algorithms

Related objects

Reset password