The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as König-Egerváry graphs. König-Egerváry graphs have been studied extensively from a graph theoretic point of view. In this paper, we introduce and study the algorithmic complexity of finding maximumKönig-Egerváry subgraphs of a given graph. More specifically, we look at the problem of findin...

background: one of the challenges of pet/mri combined systems is to derive an attenuation map to correct the pet image. for that, the pseudo-ct image could be used to correct the attenuation. until now, most existing scientific researches construct this pseudo-ct image using the registration techniques. however, these techniques suffer from the local minima of the non-rigid deformation energy f...