Monotone Arithmetic Complexity of Graph Homomorphism Polynomials

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph H to n -vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new algorithms for counting and detecting graph patterns, and also for o...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 85; no. 9; pp. 2554 - 2579
Main Authors:	Komarath, Balagopal, Pandey, Anurag, Rahul, C. S.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2023 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Circuits Combinatorial analysis Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Homomorphisms Mathematics of Computing Polynomials Theory of Computation Homomorphism polynomials Monotone complexity Graph homomorphisms Treewidth Fixed-parameter algorithms and complexity Algebraic circuits Fine-grained complexity Algebraic branching programs Algebraic complexity Algebraic formulas Graph algorithms Pathwidth Treedepth
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!