G-COM 2011 - G-COM International Workshop on Graphs and Complex Object Matching

Applications such as digital libraries, mediation systems or architectures based on Web services produce huge amounts of data that lead to the generation of a large number of models that are to be stored and accessible by users (customers) by means of suitable query interfaces. These models which describe complex objects such as documents, business processes or ontologies related to specific areas of knowledge are usually represented by graphs. Most applications that handle such models use graph techniques such as the matching process to access data by exploring structural and semantic properties of these graphs.
Furthermore, the graph matching is one of the known hard problems in graph theory and optimization. Several algorithms and heuristics have been developed for exact and inexact matchings, embedding and packing of graphs on general graphs and/or graph classes.
The purpose of this workshop is to bring together different communities of academic and industrial researchers working on problems of matching of graph models. Discussions will be held on theoretical and applied aspects of these problems.
Topics of interest include (but are not limited to):
? Graph matching and Web service
? Graph matching and ontologies
? Graph matching and document matching (XML,…)
? Graph matching and semantic Web
? Graph matching and business process
? Graph indexing
? Graph mining
? Graph embedding/packing
? Graph isomorphism/homomorphism
? Graph decomposition
? Graph similarity measures
? Tools for matching
? Query languages for complex object discovery
? Resource discovery and matching
? Techniques and algorithms for information filtering and indexing
? User profile matching for personalization
? Matchings in bioinformatics, social networks,…