On the thinness of trees

The study of structural graph width parameters like tree-width, clique-width and rank-width has been ongoing during the last five decades, and their algorithmic use has also been increasing (Cygan et al., 2015). New width parameters continue to be defined, for example, MIM-width in 2012, twin-width...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 365; pp. 39 - 60
Main Authors:	Bonomo-Braberman, Flavia, Brandwein, Eric, Gonzalez, Carolina Lucía, Sansone, Agustín
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.04.2025
Subjects:	Polynomial time algorithm Thinness Trees Trees Thinness Polynomial time algorithm
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!