Complexity of modification problems for reciprocal best match graphs (Q2290642)
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 7159818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of modification problems for reciprocal best match graphs |
scientific article; zbMATH DE number 7159818 |
Statements
Complexity of modification problems for reciprocal best match graphs (English)
0 references
29 January 2020
0 references
reciprocal best matches
0 references
hierarchically colored cographs
0 references
orthology relation
0 references
bicluster graph
0 references
editing
0 references
NP-hardness
0 references
parameterized algorithms
0 references
0.873809814453125
0 references
0.865692138671875
0 references
0.7822709083557129
0 references
0.7484607100486755
0 references
0.7319065928459167
0 references
