Identifying and locating-dominating codes: NP-completeness results for directed graphs (Q4677540)
From MaRDI portal
!
WARNING
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 2167260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying and locating-dominating codes: NP-completeness results for directed graphs |
scientific article; zbMATH DE number 2167260 |
Statements
Identifying and locating-dominating codes: NP-completeness results for directed graphs (English)
0 references
11 May 2005
0 references
0.8936142921447754
0 references
0.8063449859619141
0 references
0.8029618263244629
0 references
0.8006119728088379
0 references
0.7925650477409363
0 references
