search

jhu-graphstat / LSGMcode

This directory contains the codes for reproducing the figures in the paper Spectral Clustering for Divide-and-Conquer Graph Matching
0 stars 1 forks source link

Non-Edges in Weighted Graphs #17

Open jtmatterer opened 9 years ago

jtmatterer commented 9 years ago

When graphs have weighted edges, replacing non-edges in the original adjacency matrix with -1's here may not be a sufficient correction when adding dummy nodes.