Tight Bounds for Graph Homomorphism and Subgraph Isomorphism

Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala. Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. pages 1643-1649, SIAM, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.