47 search results - page 3 / 10 » Inexact Graph Matching: A Case of Study |
DM
2010
13 years 4 months ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
ENTCS
2007
13 years 4 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
CIVR
2007
Springer
13 years 11 months ago
2007
Springer
The ability to match faces in video is a crucial component for many multimedia applications such as searching and recognizing people in semantic video browsing, surveillance and h...