Elias Dahlhaus und Algorithm - Info zur Person

(1 - 16 von 26

)

Programm des 27. Theorietages

wwwmayr.in.tum.de

More Efficient Parallel Flow Algorithms. 12:20, Elias Dahlhaus (Sydney) Ein einfacher effizienter paralleler Algorithmus für die Erkennung von Intervallgraphen.

Approximation and Online Algorithms: 4th International Workshop, WAOA...

books.google.de

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in...

Fast Parallel Algorithms for Graph Matching Problems - Marek...

books.google.com.ua

The matching problem is one of the central problems in graph theory as well as in the theory of algorithms and their applications. This book will provide the...

Chordale Graphen im besonderen Hinblick auf parallele Algorithmen -...

books.google.de

Chordale Graphen im besonderen Hinblick auf parallele Algorithmen. Front Cover. Elias Dahlhaus pages. 0 Reviews ...

Optimal (parallel) Algorithms for the All-to-all Vertices Distance...

books.google.com.ua

Abstract:

Formale Begriffsanalyse: Links

www.math.tu-dresden.de

Uni Karlsruhe, WS96/97, Seminar: Methoden der Begriffsanalyse in der Softwaretechnik. Uni Bonn, WS95/96, Priv.-Doz. Dr. Elias Dahlhaus: Algorithmen auf geordneten Strukturen.

Efficient parallel and linear time sequential split decomposition...

link.springer.com

We prove that split decomposition can be done in in polylogarithmic time with a linear processor bound. Moreover the algorithm can be turned into a linear time...

Schloss Dagstuhl : Seminar Homepage

www.dagstuhl.de

... tree decomposition and approximation algorithms, Elias Dahlhaus presented new results on minimal fill-in ordering of planar graphs in linear ...

A linear-time algorithm to compute a MAD tree of an interval graph...

slideplayer.com

In general case, finding a MAD tree is NP-hard ► B.Y. Wu, G. Lancia, V. Bafna, K.M. Chao, R. Ravi, C.Y. Tang, 1999, polynomial-time approximation ► E....

A Pratical and Efficient Algorithm for Substitution Decomposition -...

hal.inria.fr

Citation. Elias Dahlhaus, Jens Gustedt, Ross M. Mcconnell. A Pratical and Efficient Algorithm for Substitution Decomposition. Proceedings of the Eighth Annual ...

CONTINUE? Expanding the text here will generate a large amount of data for your browser to display. Efficient Parallel Algorithms on Chordal. Graphs with a Sparse Tree Representation. Elias Dahlhaus. Basser Dept. of Computer Science. University of Sydney. NSW 2006, Australia. .oz.au.

Person "Dahlhaus" (5)
Vorname "Elias" (4475)
Name "Dahlhaus" (437)

sortiert nach Relevanz / Datum

Erweiterte Suche

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Elias Dahlhaus und Algorithm Person-Info

Programm des 27. Theorietages

Approximation and Online Algorithms: 4th International Workshop, WAOA...

Fast Parallel Algorithms for Graph Matching Problems - Marek...

Chordale Graphen im besonderen Hinblick auf parallele Algorithmen -...

Optimal (parallel) Algorithms for the All-to-all Vertices Distance...

Formale Begriffsanalyse: Links

Efficient parallel and linear time sequential split decomposition...

Schloss Dagstuhl : Seminar Homepage

A linear-time algorithm to compute a MAD tree of an interval graph...

A Pratical and Efficient Algorithm for Substitution Decomposition -...

1

Inria - Efficient and Practical Algorithms for Sequential Modular...

LIMOS - Annuaire

Philippe Gambette - Bibliographie d'algorithmes de décomposition...

Philippe Gambette - Bibliography of modular decomposition algorithms

bibtex - LiU IDA

Alle Infos zum Namen "Elias Dahlhaus"