#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2004

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sébastien Sorlin, Christine Solnon
- GbRPR
- 2005

Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching, giving rise to different graph similarity measures. A first goal of this paper is to show that these different measures can be viewed as special cases of a generic similarity measure… (More)

- Sébastien Sorlin, Christine Solnon
- CPAIOR
- 2004

The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less efficient than dedicated algorithms… (More)

- Sébastien Sorlin, Christine Solnon
- Constraints
- 2008

We introduce a new filtering algorithm, called IDL(d)-filtering, for a global constraint dedicated to the graph isomorphism problem—the goal of which is to decide if two given graphs have an identical structure. The basic idea of IDL(d)-filtering is to label every vertex with respect to its relationships with other vertices around it in the graph, and to… (More)

- Olfa Sammoud, Sébastien Sorlin, Christine Solnon, Khaled Ghédira
- EvoCOP
- 2006

Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph similarity measure based on a multivalent graph matching and which is generic in the sense that other well known graph similarity measures can be viewed as special cases of it. We… (More)

A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express… (More)

- Sébastien Sorlin, Christine Solnon, Jean-Michel Jolion
- Applied Graph Theory in Computer Vision and…
- 2007

Many applications such as information retrieval and classification, involve measuring graph distance or similarity, i.e., matching graphs to identify and quantify their common features. Different kinds of graph matchings have been proposed, giving rise to different graph similarity or distance measures. Graph matchings may be univalent – when each vertex is… (More)

The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem may be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less e cient than dedicated algorithms which… (More)

- Sébastien Sorlin, Christine Solnon
- JFPLC
- 2004

The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less efficient than dedicated algorithms… (More)

Many applications involve measuring object similarity. When the objects are modeled by graphs, measuring the similarity turn into a graph matching problem, i.e., into the search for a best matching between the graphs vertices. In this paper, we address the problem of computing a graph similarity measure based on a multivalent graph matching. This measure… (More)

- ‹
- 1
- ›