Finding the Cheapest Way to Build a Graph
Mathematics Exchange · 2025
DOI: 10.33043/92ra679d ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics Exchange, 2025. Verfasst von Shu Qian und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
The Concept Reinforcement Problem is a graph optimization problem introduced by Novikoff. One seeks to build a graph G vertex by vertex in the cheapest way possible for that graph. The cost function for each vertex is a positive, decreasing, convex function where the input is determined by the number of neighbors already built. We solve this problem for a variety of different graphs such as simple connected small-sized graphs, trees, cycles, wheels, grid graphs, ladder graphs, and complete bipartite graphs.
Zitieren
APA
Qian, S., & Rao, S. (2025). Finding the Cheapest Way to Build a Graph. Mathematics Exchange. https://doi.org/10.33043/92ra679d
Vancouver
Qian S, Rao S. Finding the Cheapest Way to Build a Graph. Mathematics Exchange. 2025. doi:10.33043/92ra679d
BibTeX
@article{Qian2025,
author = {Qian, Shu and Rao, Samiha},
title = {Finding the Cheapest Way to Build a Graph},
journal = {Mathematics Exchange},
year = {2025},
doi = {10.33043/92ra679d}
}
EUVIMED