Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs

@inproceedings{Okrasa2020FinegrainedCO,
  title={Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs},
  author={Karolina Okrasa and Paweł Rzążewski},
  booktitle={SODA},
  year={2020}
}
  • Karolina Okrasa, Paweł Rzążewski
  • Published in SODA 2020
  • Computer Science, Mathematics
  • For graphs $G$ and $H$, a \emph{homomorphism} from $G$ to $H$ is an edge-preserving mapping from the vertex set of $G$ to the vertex set of $H$. For a fixed graph $H$, by \textsc{Hom($H$)} we denote the computational problem which asks whether a given graph $G$ admits a homomorphism to $H$. If $H$ is a complete graph with $k$ vertices, then \textsc{Hom($H$)} is equivalent to the $k$-\textsc{Coloring} problem, so graph homomorphisms can be seen as generalizations of colorings. It is known that… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 46 REFERENCES

    Graphs and homomorphisms

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    Strongly rigid graphs and projectivity

    • B. Larose, C. Tardif
    • Multiple-Valued Logic, 7:339–361
    • 2001
    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Complexity of k-SAT

    • Russell Impagliazzo, Ramamohan Paturi
    • Mathematics, Computer Science
    • Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
    • 1999
    VIEW 17 EXCERPTS
    HIGHLY INFLUENTIAL

    On the complexity of H-coloring

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Parameterized Algorithms

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Families of strongly projective graphs

    • Benoît Larose
    • Mathematics, Computer Science
    • Discussiones Mathematicae Graph Theory
    • 2002
    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Strongly Projective Graphs

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Deleting Vertices to Graphs of Bounded Genus

    VIEW 1 EXCERPT

    Tight Lower Bounds on Graph Embedding Problems

    VIEW 1 EXCERPT