Computing Small Pivot-Minors - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Computing Small Pivot-Minors

Konrad K. Dabrowski
  • Fonction : Auteur
  • PersonId : 972724
François Dross
Jisu Jeong
  • Fonction : Auteur
O-Joung Kwon
Sang-Il Oum
  • Fonction : Auteur
Daniël Paulusma

Résumé

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. We initiate a systematic study into their complexity aspects. We first prove that the Pivot-Minor problem, which asks if a given graph G contains a given graph H as a pivot-minor, is NP-complete. If H is not part of the input, we denote the problem by H-Pivot-Minor. [...]

Dates et versions

hal-02083512 , version 1 (29-03-2019)

Identifiants

Citer

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, et al.. Computing Small Pivot-Minors. WG 2018 - 44th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2018, Cottbus, Germany. pp.125-138, ⟨10.1007/978-3-030-00256-5_11⟩. ⟨hal-02083512⟩
91 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More