Work

Counting Problems in Parameterized Complexity

Year: 2019

Type: article

Abstract: This survey is an invitation to parameterized counting problems for readers with a background in parameterized algorithms and complexity. After an introduction to the peculiarities of counting complexity, we survey the parameterized approach to counting problems, with a focus on two topics of recent interest: Counting small patterns in large graphs, and counting perfect matchings and Hamiltonian cycles in well-structured graphs. While this survey presupposes familiarity with parameterized algorithms and complexity, we aim at explaining all relevant notions from counting complexity in a self-contained way.

Source: DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

DOI: 10.4230/lipics.ipec.2018.1

Author: Curticapean, Radu

Institutions: IT University of Copenhagen, Saarland University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Villum Fonden, Bhabha Atomic Research Centre

Award: G4422840520