Sébastien Sorlin

According to our database, Sébastien Sorlin authored at least 7 papers between 2004 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

A parametric filtering algorithm for the graph isomorphism problem.

Sébastien Sorlin, Christine Solnon

Constraints An Int. J., 2008

2007

A Generic Graph Distance Measure Based on Multivalent Matchings.

Sébastien Sorlin, Christine Solnon, Jean-Michel Jolion

Proceedings of the Applied Graph Theory in Computer Vision and Pattern Recognition, 2007

Filtering for Subgraph Isomorphism.

Stéphane Zampelli, Yves Deville, Christine Solnon, Sébastien Sorlin, Pierre Dupont

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems.

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

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005

Reactive Tabu Search for Measuring Graph Similarity.

Sébastien Sorlin, Christine Solnon

Proceedings of the Graph-Based Representations in Pattern Recognition, 2005

2004

Une contrainte globale pour le problème de l'isomorphisme de graphes.

Sébastien Sorlin, Christine Solnon

Proceedings of the Programmation en logique avec contraintes, 2004

A Global Constraint for Graph Isomorphism Problems.

Sébastien Sorlin, Christine Solnon

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004