NetLogo / NetLogo/NW-Extension
betweenness centrality is cubic in the number of nodes, could be better
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- Scala
- Stars
- 66
- Forks
- 25
- PR merge metrics
- No merged PRs in 30d
Description
Currently, it's O(|V|^3), but it could be O(|V||E|), which would be much faster for most common networks: http://algo.uni-konstanz.de/publications/b-fabc-01.pdf
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names no file or test. Start by locating the betweenness-centrality implementation in the Scala extension, then read the cited paper to understand the O(|V||E|) algorithm. Compare its behavior with the existing implementation and verify that the reported complexity improves without changing centrality results.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- scala
- Domain
- data
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100