Cargando…

Solving Problems on Graphs of High Rank-Width

A modulator in a graph is a vertex set whose deletion places the considered graph into some specified graph class. The cardinality of a modulator to various graph classes has long been used as a structural parameter which can be exploited to obtain fixed-parameter algorithms for a range of hard prob...

Descripción completa

Detalles Bibliográficos
Autores principales: Eiben, Eduard, Ganian, Robert, Szeider, Stefan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6957011/
https://www.ncbi.nlm.nih.gov/pubmed/31997848
http://dx.doi.org/10.1007/s00453-017-0290-8