The complexity of the identifying code problem in restricted graph classes (Q2870024)
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 6247325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the identifying code problem in restricted graph classes |
scientific article; zbMATH DE number 6247325 |
Statements
The Complexity of the Identifying Code Problem in Restricted Graph Classes (English)
0 references
17 January 2014
0 references
0.9268215894699096
0 references
0.8609840869903564
0 references
0.8421483635902405
0 references
0.8260745406150818
0 references
0.8216754794120789
0 references
