Computing small pivot-minors [software]

Konrad K. Dabrowski
A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. However, so far, pivot-minors have only been studied from a structural perspective. In the associated paper, we initiate a systematic study into their complexity aspects. We first prove that the Pivot-Minor problem, which asks if a given graph...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.