Improving Greedy Spanner Construction Algorithm
In recent years, several algorithms with different time complexities have been proposed for the construction of greedy spanners. However, a not so apparently suitable algorithm with running time complexity , namely the FG algorithm, is proved to be practically the fastest algorithm known for this ta...
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Argitaratua: |
Ferdowsi University of Mashhad
2023-04-01
|
| Saila: | Computer and Knowledge Engineering |
| Gaiak: | |
| Sarrera elektronikoa: | https://cke.um.ac.ir/article_43417_2be04e289101b9eff3dbd94e33c6ee4d.pdf |