Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Color Refinement for Relational Structures
Benjamin Scheidt, Nicole Schweikardt
Color Refinement, also known as Naive Vertex Classification, is a classical method to distinguish graphs by iteratively computing a coloring of their vertices. While it is mainly u…
cs.DB2024
Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas
Cristian Riveros, Benjamin Scheidt, Nicole Schweikardt
We present an index structure, called the color-index, to boost the evaluation of acyclic conjunctive queries (ACQs) over binary schemas. The color-index is based on the color refi…
cs.LO2024
On Homomorphism Indistinguishability and Hypertree Depth
Benjamin Scheidt
is a logic introduced by Scheidt and Schweikardt (2023) to express properties of hypergraphs. It is similar to first-order logic with counting quantifiers () adapted to t…