Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs (Q6591462)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs |
scientific article; zbMATH DE number 7900288
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs |
scientific article; zbMATH DE number 7900288 |
Statements
Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs (English)
0 references
22 August 2024
0 references
modular decomposition
0 references
perfect order
0 references
galled-tree
0 references
cograph
0 references
NP-hard problems
0 references
linear-time algorithms
0 references
0 references
