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

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 350; pp. 100 - 122
Main Authors:	Cordasco, Gennaro, Gargano, Luisa, Rescigno, Adele A.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.06.2024
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!