On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs

Mim-width and sim-width are among the most powerful graph width parameters, with sim-width more powerful than mim-width, which is in turn more powerful than clique-width. While several NP-hard graph problems become tractable for graph classes whose mim-width is bounded and quickly computable, no alg...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 955; s. 113825
Hlavní autori:	Munaro, Andrea, Yang, Shizhou
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 26.04.2023
Predmet:	[formula omitted] algorithm Hereditary graph class Mim-width Sim-width Width parameter XP algorithm Mim-width Sim-width Hereditary graph class Width parameter
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!