An adjacency tensor based third order graph matching algorithm is proposed. It enjoys a much lower storage complexity than affinity tensor based high order algorithms. Instead of spectral decomposition based optimization, it adopts gradient based optimization. Experiments on synthetic and real-world data witness its state-of-the-art performance.