graph edit distance

[[concept]]

$L_1$ 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 $L_1$ norm or “edit distance” is given by $d_1(G,G’)=||A-A’|{|}_1$ where $A,A’$ are the unweighted adjacency matrices of $G,G’$ respectively.

see also distance, norm, matrix norm

Mentions

Mentions

TABLE
FROM [[]]
 
FLATTEN choice(contains(artist, this.file.link), 1, "") + choice(contains(author, this.file.link), 1, "") + choice(contains(director, this.file.link), 1, "") + choice(contains(source, this.file.link), 1, "") as direct_source
 
WHERE !direct_source

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>
}