StarIso: Graph Isomorphism Through Lossy Compression
Jason Fairey, Lawrence B. Holder · 2016
Summary form only given: Graph data has gained importance as social networks, shopping habits, and travel patterns are recorded in much greater detail and quantity. An important step in making this information useful is the ability to compare two different portions of this data. In this paper, we explore a method for fast compression of graph data and how that can be used for comparison. We show that when performing one-to-many matching it performs quite well against VF2, currently one of the best strict graph matching algorithms.