Exploring the gap between treedepth and vertex cover through vertex integrity

For problems intractable on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained algorithmic and complexity results. Although the studies in this direction are successful, we still need a systematic way for further investigations b...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 918; pp. 60 - 76
Main Authors:	Gima, Tatsuya, Hanaka, Tesshu, Kiyomi, Masashi, Kobayashi, Yasuaki, Otachi, Yota
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 29.05.2022
Subjects:	Treedepth Vertex cover number Vertex integrity Vertex integrity Vertex cover number Treedepth
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!