The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712)
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: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs |
scientific article; zbMATH DE number 1493482
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs |
scientific article; zbMATH DE number 1493482 |
Statements
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (English)
0 references
21 August 2000
0 references
fixed parameter intractability
0 references
triangulation of colored graphs
0 references
graph problems
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
