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

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete Applied Mathematics Ročník 350; s. 100 - 122
Hlavní autoři:	Cordasco, Gennaro, Gargano, Luisa, Rescigno, Adele A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 15.06.2024
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!