A faster algorithm for the cluster editing problem on proper interval graphs (Q495665)
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: A faster algorithm for the cluster editing problem on proper interval graphs |
scientific article; zbMATH DE number 6482171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for the cluster editing problem on proper interval graphs |
scientific article; zbMATH DE number 6482171 |
Statements
A faster algorithm for the cluster editing problem on proper interval graphs (English)
0 references
15 September 2015
0 references
graph algorithms
0 references
cluster editing problem
0 references
proper interval models
0 references
linear space algorithm
0 references
0.8241005539894104
0 references
0.8128411769866943
0 references
0.7917558550834656
0 references
0.7872315049171448
0 references
