Matching Graphs with Unique Node Labels
In its most general form, graph matching refers to the problem of finding a mapping f from the nodes of one given graph g1 to the nodes of another given graph g2 that satisfies some constraints or optimality criteria. For example, in graph isomorphism detection , mapping f is a bijection that preserves all edges and labels. In subgraph isomorphism detection , mapping f has to be injective such that all edges of g1 are included in g2 and all labels are preserved. Other graph matching problems that require the constructions of a mapping f with particular properties are maximum common subgraph detection [118, 129] and graph edit distance computation [131, 151].
KeywordsMedium Access Control Edge Density Graph Match Node Label Edit Operation
Unable to display preview. Download preview PDF.