Approximation algorithms for intersection graphs

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg ; 2009-06

Classification: Mathematik

Event: Veröffentlichung

(where): Augsburg

(who): Universität Augsburg

(when): 2009

Creator: Kammer, Frank
Tholey, Torsten
Voepel, Heiko

URN: urn:nbn:de:bvb:384-opus4-10964

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

Last update: 25.03.2025, 1:42 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

Associated

Kammer, Frank
Tholey, Torsten
Voepel, Heiko
Universität Augsburg

Time of origin

2009

Other Objects (12)

Declarative Graph Algorithms via Knuth-Bendix Completion

Derivation of graph and pointer algorithms

Hochschulschrift

Disk Intersection Graphs: Models, Data Structures, and Algorithms

Shorter paths to graph algorithms

Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid

Algebraic calculation of graph and sorting algorithms

Hochschulschrift

Treelike and Chordal Graphs: Algorithms and Generalizations

Algebraic calculation of graph and sorting algorithms

zweidimensionales bewegtes Bild

Graph algorithms and population protocols: Distributed Distance Approximation

Declarative Graph Algorithms via Knuth-Bendix Completion

Derivation of graph and pointer algorithms

Hochschulschrift

Disk Intersection Graphs: Models, Data Structures, and Algorithms

Shorter paths to graph algorithms

Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid

Algebraic calculation of graph and sorting algorithms

Hochschulschrift

Treelike and Chordal Graphs: Algorithms and Generalizations

Algebraic calculation of graph and sorting algorithms

zweidimensionales bewegtes Bild

Graph algorithms and population protocols: Distributed Distance Approximation

Declarative Graph Algorithms via Knuth-Bendix Completion

Derivation of graph and pointer algorithms

Hochschulschrift

Disk Intersection Graphs: Models, Data Structures, and Algorithms

Shorter paths to graph algorithms

Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid

Algebraic calculation of graph and sorting algorithms

Hochschulschrift

Treelike and Chordal Graphs: Algorithms and Generalizations

Algebraic calculation of graph and sorting algorithms

zweidimensionales bewegtes Bild

Graph algorithms and population protocols: Distributed Distance Approximation

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.

Approximation algorithms for intersection graphs

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Declarative Graph Algorithms via Knuth-Bendix Completion

Derivation of graph and pointer algorithms

Derivation of graph and pointer algorithms

Disk Intersection Graphs: Models, Data Structures, and Algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid

Algebraic calculation of graph and sorting algorithms

Treelike and Chordal Graphs: Algorithms and Generalizations

Algebraic calculation of graph and sorting algorithms

Graph algorithms and population protocols: Distributed Distance Approximation

Declarative Graph Algorithms via Knuth-Bendix Completion

Derivation of graph and pointer algorithms

Derivation of graph and pointer algorithms

Disk Intersection Graphs: Models, Data Structures, and Algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid

Algebraic calculation of graph and sorting algorithms

Treelike and Chordal Graphs: Algorithms and Generalizations

Algebraic calculation of graph and sorting algorithms

Graph algorithms and population protocols: Distributed Distance Approximation

Declarative Graph Algorithms via Knuth-Bendix Completion

Derivation of graph and pointer algorithms

Derivation of graph and pointer algorithms

Disk Intersection Graphs: Models, Data Structures, and Algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Shorter paths to graph algorithms

Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid

Algebraic calculation of graph and sorting algorithms

Treelike and Chordal Graphs: Algorithms and Generalizations

Algebraic calculation of graph and sorting algorithms

Graph algorithms and population protocols: Distributed Distance Approximation

Related objects

Reset password