Add a function to find densest subgraph
@mtreinish is already working on this.
Since Mar 27, 2022.
Assessment
This issue has not been assessed yet.
Description
What is the expected enhancement?
Something that came up in the review on https://github.com/Qiskit/qiskit-terra/pull/7740 is that it would be good for retworkx to have a function to find the densest subgraph in a graph. To start we can just reuse the algorithm from the DenseLayout pass which just performs a BFS list from every node in the graph (in parallel) and takes the first n nodes from that and applies the weights and picks the most connected one with the best score from the weights. I'm not familiar with the literature on this problem space, but if there is a better algorithm that offers a faster or more complete solution we can look at implementing that too.
- Dominant language
- Rust
- Stars
- 1.8k
- Forks
- 220
- Avg merge
- 3d 16h
- Merged PRs (30d)
- 3
Contributor guide
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.
More from Qiskit/rustworkx
-
Difficulty 4/5 3-5 days Newbie friendliness 55/100
-
documentation
Difficulty 4/5 3-5 days Newbie friendliness 48/100
-
Difficulty 4/5 3-5 days Newbie friendliness 45/100
-
bug
Difficulty 3/5 1-2 days Newbie friendliness 65/100
-
Difficulty 4/5 3-5 days Newbie friendliness 48/100
All issues in Qiskit/rustworkx
Similar issues
-
Difficulty 2/5 1-3 hours Newbie friendliness 86/100
kwakseongjae/auto-hwp#319 ·
-
area:cli bug filter-quality good first issue priority:medium
Difficulty 2/5 1-3 hours Newbie friendliness 84/100
-
Difficulty 1/5 Under an hour Newbie friendliness 72/100
bevyengine/bevy#25861 ·
-
comp-datalake
Difficulty 2/5 1-3 hours Newbie friendliness 88/100
ClickHouse/ClickHouse#121222 ·
-
enhancement remote
Difficulty 2/5 1-3 hours Newbie friendliness 68/100