Compute s-closeness via Dynamic Programming

pnnl / chgl

Chapel HyperGraph Library (CHGL) - HPC-class Hypergraphs in Chapel

https://pnnl.github.io/chgl/

MIT License

29 stars 8 forks source link

Compute s-closeness via Dynamic Programming #51

Closed LouisJenkinsCS closed 4 years ago

LouisJenkinsCS commented 5 years ago

Given the definition, to compute d(f,g), if we have already encountered d(h,g) then we can compute d(f,h) + d(h,g) to save a substantial amount of time.

LouisJenkinsCS commented 5 years ago

Perhaps I can create a caching system for more intuitive dynamic programming support. Following from the prior cache idea I had before.

github-actions[bot] commented 4 years ago

This issue is stale and should either be closed or eventually resolved.