A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259)
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 linear time algorithm for liar's domination problem in proper interval graphs |
scientific article; zbMATH DE number 6284230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for liar's domination problem in proper interval graphs |
scientific article; zbMATH DE number 6284230 |
Statements
A linear time algorithm for liar's domination problem in proper interval graphs (English)
0 references
14 April 2014
0 references
graph algorithms
0 references
liar's domination
0 references
proper interval graphs
0 references
undirected path graphs
0 references
0.8837385773658752
0 references
0.8757623434066772
0 references
0.8629193305969238
0 references
0.8273253440856934
0 references
