Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Closeness and Decision Making

Chavdar Dangalchev

Abstract

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.

Closeness and Decision Making

Abstract

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.
Paper Structure (9 sections, 78 equations, 1 table)

This paper contains 9 sections, 78 equations, 1 table.

Table of Contents

  1. Introduction
  2. Decision Theory - Criteria
  3. Additional closeness vs. Decision Making
  4. Previous Results
  5. Decision making for two complete graphs
  6. Decision Making for Lollipop Graph
  7. Formula for closeness of cycles
  8. Minimum of cycles
  9. Conclusion

Theorems & Definitions (7)

  • proof
  • proof
  • proof
  • proof
  • proof
  • proof
  • proof