JuliaGraphs / JuliaGraphs/MatrixNetworks.jl
Gale-Ryser and Fulkerson–Chen–Anstee checks for degree sequences.
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 110
- Forks
- 25
- PR merge metrics
- No merged PRs in 30d
Description
Now that we have Havel Hakimi, it'd be good to have analog for the bipartite graph and directed graph.
(https://en.wikipedia.org/wiki/Gale%E2%80%93Ryser_theorem)
and
https://en.wikipedia.org/wiki/Fulkerson%E2%80%93Chen%E2%80%93Anstee_theorem
Although the second seems very close to the former.
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
Review the existing Havel–Hakimi check as the nearest entry point, then read the linked Gale–Ryser and Fulkerson–Chen–Anstee theorem references. Define checks for bipartite and directed degree sequences, with completion requiring both theorem-based cases to be supported.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100