I have a situation where I have two graphs that are supposed to represent the same underlying topology but represent the underlying topology at different resolutions. My goal is to match vertices between the two graphs.
Let's say the graphs represent a city's street system, with vertices being intersections and edges being streets. G1 is a full detail map with alleys, streets, highways, etc... G2 is an overview map with major roads and highways only. I want the find all the intersections from G2 on G1. The edges won't exactly match because there will be intermediate vertices in G1. The node degrees may also not exactly match because G2 may simplify a round-about intersection to its major streets, but G1 will also include the side-streets radiating from it.