Login / Signup
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters.
Carla Groenland
Isja Mannens
Jesper Nederlof
Marta Piecyk
Pawel Rzazewski
Published in:
CoRR (2023)
Keyphrases
</>
tight bounds
upper bound
graph representation
structured data
directed acyclic graph
graph structure
expected values
graph theory
data sets
parameter settings
parameter values
parameter estimation
random walk
parameter space
weighted graph
connected components
graph partitioning
lower bound