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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 86; H. 4; S. 944 - 1005
Hauptverfasser:	Goldberg, Leslie Ann, Roth, Marc
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2024 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!