Research Group Algorithmics and Computational ComplexityTalk 30.08.2017-2

# Parameterized Aspects of Triangle Enumeration

Matthias Bentert (TU Berlin)

Listing all triangles in an undirected graph is a fundamental graph primitive with numerous applications. It is trivially solvable in time cubic in the number of vertices. It has seen a significant body of work contributing to both theoretical aspects (e.g., lower and upper bounds on running time, adaption to new computational models) as well as practical aspects (e.g. algorithms tuned for large graphs). Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration, providing both positive results (new enumerative kernelizations, subcubic'' parameterized solving algorithms) as well as negative results (uselessness in terms of possibility of faster'' parameterized algorithms of certain parameters such as diameter).

This is a joint work with Till Fluschnik, André Nichterlein, and Rolf Niedermeier.

Date
Speaker
Location
Language
30.08.2017
16:15
Matthias Bentert
TEL 512
English

Back to the research colloquium site.