graph edit distance

[[concept]]
L1 norm for graphs

Let G and G be graphs with the same n and the same node sets V=V (ie, same node labelling). The L1 norm or “edit distance” is given by

d1(G,G)=||AA||1$$where$A,A$aretheunweighted[[ConceptWiki/adjacencymatrixadjacencymatrices]]of$G,G$respectively.

see also distance, norm, matrix norm

Mentions

Mentions

const { dateTime } = await cJS()

return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}