Combinatorial identification problems and graph powers (Q766254)
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 6018315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial identification problems and graph powers |
scientific article; zbMATH DE number 6018315 |
Statements
Combinatorial identification problems and graph powers (English)
0 references
23 March 2012
0 references
graphs
0 references
algorithms
0 references
NP-complete problems
0 references
identifying codes
0 references
distance in graphs
0 references
powers of graphs
0 references
0 references
0.7641600370407104
0 references
0.754673957824707
0 references
0.7536492943763733
0 references
0.7519893050193787
0 references
0.7476121187210083
0 references
