Skip to main content

1 Result(s)

within English Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Computer Graphics Remove this filter Data Structures Remove this filter Sang-il Oum Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Computing Small Pivot-Minors

    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 fa...

    Konrad K. Dabrowski, François Dross… in Graph-Theoretic Concepts in Computer Scien… (2018)