Parameterised and Fine-Grained Subgraph Counting, Modulo 2

Given a class of graphs H , the problem ⊕ Sub ( H ) is defined as follows. The input is a graph H ∈ H together with an arbitrary graph G . The problem is to compute, modulo 2, the number of subgraphs of G that are isomorphic to H . The goal of this research is to determine for which classes H the pr...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 86; no. 4; pp. 944 - 1005
Main Authors:	Goldberg, Leslie Ann, Roth, Marc
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2024 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph matching Graph theory Lower bounds Mathematics of Computing Theory of Computation Theory of computation Problems Subgraph counting Fine-grained complexity Parameterised complexity reductions and completeness Mathematics of computing Discrete mathematics Modular counting
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!