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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 85; číslo 9; s. 2554 - 2579
Hlavní autoři:	Komarath, Balagopal, Pandey, Anurag, Rahul, C. S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.09.2023 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!