Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters.
Carla GroenlandIsja MannensJesper NederlofMarta PiecykPawel RzazewskiPublished in: ICALP (2024)
Keyphrases
- tight bounds
- upper bound
- adjacency matrix
- maximum likelihood
- graph theoretic
- eigenvalues and eigenvectors
- structured data
- graph representation
- graph theory
- bipartite graph
- parameter values
- graph matching
- singular value decomposition
- graph partitioning
- parameter space
- directed graph
- parameter estimation
- jacobian matrix
- social networks
- laplace transform
- similarity matrix
- graph based algorithm
- asymptotically optimal
- graph mining
- expectation maximization
- markov chain
- worst case
- pairwise
- lower bound
- similarity measure