1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DM2024★ 1 cited
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
Sandra Kiefer, Daniel Neuen
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables…
cs.CC2023★ 1 cited
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
Jacob Focke, Dániel Marx, Fionn Mc Inerney +4
For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets of non-negative…