Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, October 06, 2020, 12:15 pm

**Duration**: 30 minutes

**Location**: Zoom: conference room

**Speaker**: Lior Gishboliner

We consider the problem of counting the number of copies of a fixed graph H in an input graph G. This is one of the most well-studied algorithmic graph problems, with many theoretical and practical applications. We focus on solving this problem when the input G has bounded degeneracy. This forms a rich class of graphs, which includes for example all non-trivial minor-closed classes (and in particular planar graphs). Bera, Pashanasangi, and Seshadhri recently raised the question of characterizing the graphs H such that counting H-copies in a bounded-degeneracy input graph can be done in linear time. In this work we fully resolve this question, as well as the analogous questions for counting H-homomorphisms and induced H-copies. A recent result of Bressan shows that one can count H-homomorphisms in a bounded-degeneracy graph in time $O(n^{\tau(H)})$, where $\tau$ is a suitable width parameter, called DAG treewidth. In particular, H-homomorphisms can be counted in linear time if $\tau(H) = 1$. We show that this sufficient condition is also necessary, namely that H-homomorphisms can be counted in linear time if and only if $\tau(H) = 1$. We then use this to resolve the aforementioned problem of Bera, Pashanasangi, and Seshadhri. Our proofs rely on several new ideas for proving hardness results in the context of subgraph-counting. This is a joint work with Yevgeny Levanzov and Asaf Shapira.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login