Neil Savage
Skip Abstract Section
Abstract
A theoretical breakthrough in graph isomorphism excites complexity experts, but will it lead to any practical improvements?
- Babai, L. Graph Isomorphism in Quasipolynomial Time, arXiv, Cornell University Library, 2015, http://arxiv.org/abs/1512.03547.Google Scholar
- McKay, B.D., and Piperno, A. Practical Graph Isomorphism II, Journal of Symbolic Computation, 60, 2014, http://arxiv.org/abs/1301.1493. Google ScholarDigital Library
- Fortnow, L. The status of the P versus NP problem, Communications of the ACM, September 2009, http://cacm.acm.org/magazines/2009/9/38904-the-status-of-the-p-versus-np-problem/fulltext. Google ScholarDigital Library
- Fortnow, L., and Grochow, J.A. Complexity classes of equivalence problems revisited, Information and Computation, 209, 2011, http://arxiv.org/pdf/0907.4775.pdf. Google ScholarDigital Library
- Isomorphic Graphs, Example 1, Stats-Lab Dublin https://www.youtube.com/watch?v=Xq8o-z1DsUA.Google Scholar
Index Terms
- Graph matching in theory and practice
Recommendations
On two problems in graph Ramsey theory
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices.
The Ramsey number r ( H ) of a graph ...
Comments