Timeline for Efficiently computing current flow betweenness centrality for graphs
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2023 at 15:47 | history | edited | Henrik Schumacher | CC BY-SA 4.0 | added 1 character in body |
| Nov 13, 2019 at 14:51 | comment | added | user52181 | (...) I edited the post and added a link to the latest version (a notebook with a working example), which is much simpler to show what I have now instead of pasting code again. Do you reckon my main bottleneck lies in the current calculation still? (despite being cut in half), thanks again for all your feedback. | |
| Nov 13, 2019 at 13:49 | vote | accept | CommunityBot | ||
| Nov 13, 2019 at 13:46 | comment | added | user52181 | Hi Henrik, sorry for the late reply, didn't notice how time went by... Really helpful recommendations, incorporating them reduced the absolutetiming by a third so far! I also call the current calculator function half as often as the matrix is symmetric, so now my updates sub-modules are: tau[s_, t_, v_, inoutcurrs_] := With[{bst = Piecewise[{{1., v == s}, {-1., v == t}}, 0.]}, res = 0.5*(-Abs[bst] + inoutcurrs[[v]])]; and currinbet is (...) | |
| Nov 5, 2019 at 15:39 | history | edited | Henrik Schumacher | CC BY-SA 4.0 | added 165 characters in body |
| Nov 5, 2019 at 15:34 | history | answered | Henrik Schumacher | CC BY-SA 4.0 |