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

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 955; p. 113825
Main Authors: Munaro, Andrea, Yang, Shizhou
Format: Journal Article
Language:English
Published: Elsevier B.V 26.04.2023
Subjects:
ISSN:0304-3975
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first