Graph matching encompasses a class of computational problems aimed at identifying a correspondence between the vertex sets of two graphs so as to maximise structural similarity or alignment. Exact ...

Matching preclusion examines the resilience of a network modelled as a graph by identifying the smallest set of edge removals that destroys all perfect matchings. Originating in the study of ...