On the stable image-matching problem in multigraphs Original Research Article

This paper deals with the stable image-matching problem in multigraphs, called the stable multiple activities problem, SMA for short. In an SMA instance a multigraph image, capacity image and a linear order image on the set of edges incident to image, for each vertex image are given. A stable image-matching is sought, i.e. a set of edges M such that each vertex image is incident with at most image edges and for each edge image a vertex image incident with image and image distinct edges image incident to image exist in M, all of them image-smaller than image.