Closeness and Decision Making
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912967790952448 |
|---|---|
| author | Dangalchev, Chavdar |
| author_facet | Dangalchev, Chavdar |
| contents | In this article we consider networks, which for a given time period can have one link broken. Which new link should we build so the closeness of the resulting network satisfies some optimal criteria? We consider different criteria for optimization and different graphs: cycle, paths, lollipop graphs, and two complete graphs, connected by a link. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14922 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Closeness and Decision Making Dangalchev, Chavdar Discrete Mathematics 90B50, 90C35 G.2 In this article we consider networks, which for a given time period can have one link broken. Which new link should we build so the closeness of the resulting network satisfies some optimal criteria? We consider different criteria for optimization and different graphs: cycle, paths, lollipop graphs, and two complete graphs, connected by a link. |
| title | Closeness and Decision Making |
| topic | Discrete Mathematics 90B50, 90C35 G.2 |
| url | https://arxiv.org/abs/2603.14922 |