Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with algorithmic graph theory:
TR02-021 | 11th April 2002
Andreas Jakoby, Maciej Liskiewicz, RĂ¼diger Reischuk

Space Efficient Algorithms for Directed Series-Parallel Graphs

The subclass of directed series-parallel graphs plays an important role in
computer science. Whether a given graph is series-parallel is a
well studied problem in algorithmic graph theory, for which fast sequential and
parallel algorithms have been developed in a sequence of papers.
Also methods are known to solve ... more >>>

TR09-147 | 30th December 2009
Stephan Kreutzer

Algorithmic Meta-Theorems

Algorithmic meta-theorems are general algorithmic results applying to a whole range of problems, rather than just to a single problem alone. They often have a logical and a
structural component, that is they are results of the form:
"every computational problem that can be formalised in a given logic L ... more >>>

ISSN 1433-8092 | Imprint