Computational complexity of distance edge labeling (Q1647838)
From MaRDI portal
(Redirected from Item:Q2798240)
| 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: Computational complexity of distance edge labeling |
scientific article; zbMATH DE number 6562492
- Computational Complexity of Distance Edge Labeling
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of distance edge labeling |
scientific article; zbMATH DE number 6562492 |
|
Statements
Computational complexity of distance edge labeling (English)
0 references
Computational Complexity of Distance Edge Labeling (English)
0 references
27 June 2018
0 references
4 April 2016
0 references
computational complexity
0 references
distance labeling
0 references
line-graphs
0 references
exponential time hypothesis
0 references
0 references
0.90421534
0 references
0.8982058
0 references
0.8982058
0 references
0.89731765
0 references
0.8706132
0 references
0.86876005
0 references
0.86827284
0 references