Contraction checking in graphs on surfaces - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Contraction checking in graphs on surfaces

Résumé

The Contraction Checking problem asks, given two graphs H and G as input, whether H can be obtained from G by a sequence of edge contractions. Contraction Checking remains NP-complete, even when H is fixed. We show that this is not the case when G is embeddable in a surface of fixed Euler genus. In particular, we give an algorithm that solves Contraction Checking in f(h,g)*|V(G)|^3 steps, where h is the size of H and g is the Euler genus of the input graph G.
Fichier principal
Vignette du fichier
19.pdf (2.31 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00678173 , version 1 (03-02-2012)

Identifiants

  • HAL Id : hal-00678173 , version 1

Citer

Marcin Kaminski, Dimitrios M. Thilikos. Contraction checking in graphs on surfaces. STACS'12: 29th Symposium on Theoretical Aspects of Computer Science, Feb 2012, Paris, France. pp.182-193. ⟨hal-00678173⟩
174 Consultations
64 Téléchargements

Partager

Gmail Facebook X LinkedIn More