Table 1. Distance measures and complexity.

The size (of the larger) graph is n; the number of edges is m. For the spectral decomposition, k denotes the number of principal eigenvalues we wish to find.

Distance Measure	Complexity	Ref.
Edit Distance	$\mathcal{O}\left(m\right)$	[74]
Resistance Distance (Exact)	$\mathcal{O}\left(n^2\right)$	[9]
Resistance Distance (Approximate)	$\mathcal{O}\left(m\right)$	[9]
DeltaCon (Exact)	$\mathcal{O}\left(n^2\right)$	[30]
DeltaCon (Approximate)	$\mathcal{O}\left(m\right)$	[30]
NetSimile	$\mathcal{O}\left(n\text{log}n\right)$	[32]
Spectral Distance	$\mathcal{O}\left(n{k}^2\right)$	[73]