Solving NP-hard problems on GaTEx graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets

The class of Galled-Tree Explainable (GaTEx) graphs has recently been discovered as a natural generalization of cographs. Cographs are precisely those graphs that can be uniquely represented by a rooted tree where the leaves correspond to the vertices of the graph. As a generalization, GaTEx graphs...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1037; p. 115157
Main Authors:	Hellmuth, Marc, Scholz, Guillaume E.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 11.05.2025
Subjects:	Cograph Galled-tree Linear-time algorithms Modular decomposition NP-hard problems Modular decomposition Galled-tree NP-hard problems Linear-time algorithms Cograph
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!