An Algorithm for Distributing a Resource among the Vertices of a Dynamic DAG

We present an algorithm for distributing a fixed quantity of resources among the vertices of a directed acyclic graph (DAG), where vertices can be toggled on or off, and new vertices and edges may be added over time. Central to the algorithm is a generalization of the genetic coefficient of relationship to arbitrary DAGs.

Keywords

Data Structures, Algorithms

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average