The Dynamic Complexity of Acyclic Hypergraph Homomorphisms

07/13/2021
βˆ™
by   Nils Vortmeier, et al.
βˆ™
0
βˆ™

Finding a homomorphism from some hypergraph 𝒬 (or some relational structure) to another hypergraph π’Ÿ is a fundamental problem in computer science. We show that an answer to this problem can be maintained under single-edge changes of 𝒬, as long as it stays acyclic, in the DynFO framework of Patnaik and Immerman that uses updates expressed in first-order logic. If additionally also changes of π’Ÿ are allowed, we show that it is unlikely that existence of homomorphisms can be maintained in DynFO.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 09/18/2019

Hypergraph partitions

We suggest a reduction of the combinatorial problem of hypergraph partit...
research
βˆ™ 02/06/2020

Multilevel Acyclic Hypergraph Partitioning

A directed acyclic hypergraph is a generalized concept of a directed acy...
research
βˆ™ 04/14/2021

Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time

We investigate the two problems of computing the union join graph as wel...
research
βˆ™ 01/13/2023

Hypergraph Horn functions

Horn functions form a subclass of Boolean functions possessing interesti...
research
βˆ™ 07/22/2019

Translating between the representations of a ranked convex geometry

It is well known that every closure system can be represented by an impl...
research
βˆ™ 01/15/2022

Zeon and Idem-Clifford Formulations of Hypergraph Problems

Zeon algebras have proven to be useful for enumerating structures in gra...
research
βˆ™ 12/22/2020

Structure and Complexity of Bag Consistency

Since the early days of relational databases, it was realized that acycl...

Please sign up or login with your details

Forgot password? Click here to reset