Pages that link to "Item:Q3448809"
From MaRDI portal
The following pages link to Lower Bounds for the Graph Homomorphism Problem (Q3448809):
Displaying 9 items.
- The homomorphism domination exponent (Q648968) (← links)
- Lower bounds on the differential of a graph (Q713137) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
- Exact algorithms for graph homomorphisms (Q2642907) (← links)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs (Q5146875) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5205808) (← links)