Jump to content

Graph matching

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Wcherowi (talk | contribs) at 03:47, 29 June 2017 (Added {{notability}}, {{one source}} and {{primary sources}} tags (within {{multiple issues}}) to article (TW)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
For matching defined as an independent edge set in a graph, see Matching (graph theory).

Graph matching is the problem of finding a similarity between graphs.[1]

Graphs are commonly used to encode structural information in many fields, including computer vision and pattern recognition, and graph matching is an important tools in these areas. [2]

The case of exact graph matching is known as the graph isomorphism problem.[1] The problem of exact matching of a graph to a part of another graph is called subgraph isomorphism problem.

See also

References

  1. ^ a b Endika Bengoetxea, "Inexact Graph Matching Using Estimation of Distribution Algorithms", Ph. D., 2002, Chapter 2:The graph matching problem (retrieved June 28, 2017)
  2. ^ Endika Bengoetxea, Ph.D., Abstract
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Graph_matching&oldid=788038588"