2
$\begingroup$

I recently asked this question on the Mathematics SE.

Does anyone know, as a follow up, what algorithm Mathematica uses to calculate the betweenness centrality vector (of $N$ elements) for an unweighted graph?

$\endgroup$
  • $\begingroup$ Did you ask Wolfram Support about this? In my experience they tend to provide the references. $\endgroup$ – Szabolcs Aug 3 '15 at 15:17
  • $\begingroup$ I have not asked $\endgroup$ – Alexander Giles Aug 3 '15 at 16:12
  • $\begingroup$ Ask them then, and if you get a response, please come back and write an answer to the question. $\endgroup$ – Szabolcs Aug 3 '15 at 16:24

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.