Pages that link to "Item:Q4575696"
From MaRDI portal
The following pages link to Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696):
Displaying 14 items.
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- (Q5090495) (← links)
- Fine-Grained Complexity of Rainbow Coloring and its Variants. (Q5111276) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs (Q5146875) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
- Tree-Depth and the Formula Complexity of Subgraph Isomorphism (Q5885602) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
- Proper colorability of segment intersection graphs (Q6571282) (← links)