New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
diameter for large directed real graphs #29346
Comments
Author: Madhav Wagle |
Commit: |
Changed keywords from none to gsoc, diameter |
This comment has been minimized.
This comment has been minimized.
comment:4
#29309 also implements the same algorithm. Shouldn't you join forces to obtain a stronger implementation ? |
comment:5
Replying to @dcoudert:
Hi, The definitions of diameter used by me and
which returns diameter infinity for non strongly connected graphs. My implementation considers the max finite eccentricty, as specified in https://doi.org/10.1007/978-3-319-20086-6_5 His implementation would be a much better choice if we want to keep the definition of diameter the same for all algorithms. On the other hand, I can also modify my implementation to allow the user to set a parameter to make a choice on which definition of diameter they want to use. I would only need to add 1-2 lines of code to my current implementation to do that. |
comment:6
Few changes to be made |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:8
Batch modifying tickets that will likely not be ready for 9.1, based on a review of the ticket title, branch/review status, and last modification date. |
comment:10
Setting new milestone based on a cursory review of ticket status, priority, and last modification date. |
comment:11
Setting a new milestone for this ticket based on a cursory review. |
This method implements the [d2] algorithm for computing the diameter of real directed graphs.
[d2] Takuya Akiba, Yoichi Iwata, Yuki Kawata: An Exact Algorithm for Diameters of Large Real Directed Graphs. SEA 2015: 56-67 https://doi.org/10.1007/978-3-319-20086-6_5
It is designed for directed real sparse graphs.
Component: graph theory
Keywords: gsoc, diameter
Author: Madhav Wagle
Branch/Commit: u/gh-ArchitWagle/real_directed_diameter @
b1bb1ac
Issue created by migration from https://trac.sagemath.org/ticket/29346
The text was updated successfully, but these errors were encountered: