Before revision:  In order to improve the matching performance for sparse graphs, we propose a new algorithm that uses "witnesses"
After revision:  In order to improve the matching performance for sparse graphs, we propose a new algorithm that uses seeds