Parameterized complexity for iterated type partitions and modular-width

This paper deals with the complexity of some natural graph problems parameterized by some measures that are restrictions of clique-width, such as modular-width and neighborhood diversity. We introduce a novel parameter, called iterated type partition number, that can be computed in linear time and n...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 350; S. 100 - 122
Hauptverfasser:	Cordasco, Gennaro, Gargano, Luisa, Rescigno, Adele A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.06.2024
Schlagworte:	Fixed-parameter tractability Kernelization algorithms Modular-width Neighborhood diversity Parameterized complexity Neighborhood diversity Fixed-parameter tractability Modular-width Kernelization algorithms Parameterized complexity
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!