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 the normal view instead:
scientific article; zbMATH DE number 1493482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7795297503471375
0 references
0.7773848176002502
0 references
0.7757751941680908
0 references
