4 citations · 13 across the 11 of their papers we have counts for
4 papers · 1 filter
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel +1
We study the problem of counting the number of homomorphisms from an input graph to a fixed (quantum) graph in any finite field of prime order . The sub…
Balanced Crown Decomposition for Connectivity Constraints
Katrin Casel, Tobias Friedrich, Davis Issac +2
We introduce the balanced crown decomposition that captures the structure imposed on graphs by their connected induced subgraphs of a given size. Such subgraphs are a popular model…
Shortest Distances as Enumeration Problem
Katrin Casel, Tobias Friedrich, Stefan Neubert +1
We investigate the single source shortest distance (SSSD) and all pairs shortest distance (APSD) problems as enumeration problems (on unweighted and integer weighted graphs), meani…
The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics
Jakob Bossek, Katrin Casel, Pascal Kerschke +1
Several important optimization problems in the area of vehicle routing can be seen as a variant of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary co…