summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorRoss Barnowski <rossbar@berkeley.edu>2022-09-15 08:09:53 -0700
committerGitHub <noreply@github.com>2022-09-15 08:09:53 -0700
commit2d1f159a5fc5e3b0d7da7d96b0e9be05211eed66 (patch)
tree07ac9a76920acf78c8b47084b7cd50814e5610f0
parent6662dd6d6cbaf9928bc9ccc37756f6d6fc992337 (diff)
downloadnetworkx-2d1f159a5fc5e3b0d7da7d96b0e9be05211eed66.tar.gz
Update mentored projects list (#5985)
* Add vf2pp to completed projects list. * Rm vf2pp from projects list. * Add link to Konstantinos' 2022 GSoC proposal.
-rw-r--r--doc/developer/projects.rst32
1 files changed, 6 insertions, 26 deletions
diff --git a/doc/developer/projects.rst b/doc/developer/projects.rst
index f6a29635..755b03bb 100644
--- a/doc/developer/projects.rst
+++ b/doc/developer/projects.rst
@@ -41,35 +41,14 @@ Pedagogical Interactive Notebooks for Algorithms Implemented in NetworkX
pedagogical interactive notebooks for the medium duration project and 4-5 notebooks
for the long duration project.
-Implement the VF2++ Graph Isomorphism Algorithm
------------------------------------------------
-
-- Abstract: The `Graph Isomorphism Problem`_ is a famous difficult network problem at
- the boundary between P and NP-Complete. The VF2 algorithm is included with NetworkX
- in a recursive formulation. There is an improved version of this algorithm called
- `VF2++`_ which we intend to implement. We have early attempts at a nonrecursive version
- of the main algorithm that also address subgraph isomorphism and subgraph monomorphism.
- This project involves fully implementing them and extending to directed and multigraph
- settings.
-
-- Recommended Skills: Python, graph algorithms
-
-- Expected Outcome: A new set of functions in NetworkX that implement the VF2++
- algorithm for all problem and graph types in a nonrecursive manner.
-
-- Complexity: Moderate
-
-- Interested Mentors: `@dschult <https://github.com/dschult/>`__,
- `@MridulS <https://github.com/MridulS/>`__, `@boothby <https://github.com/boothby/>`__,
-
-.. _`Graph Isomorphism Problem`: https://en.wikipedia.org/wiki/Graph_isomorphism_problem
-.. _VF2++: https://doi.org/10.1016/j.dam.2018.02.018
-
-- Expected time commitment: Long project (~350 hours)
-
Completed Projects
==================
+- `VF2++ algorithm for graph isomorphism`_
+ - Program: Google Summer of Code 2022
+ - Contributor: `@kpetridis24 <https://github.com/kpetridis24/>`__
+ - Link to Proposal: `GSoC 2022: VF2++ Algorithm <https://github.com/networkx/archive/blob/main/proposals-gsoc/GSoC-2022-VF2plusplus-isomorphism.pdf`_
+
- `Louvain community detection algorithm`_
- Program: Google Summer of Code 2021
- Contributor: `@z3y50n <https://github.com/z3y50n/>`__
@@ -98,6 +77,7 @@ Completed Projects
- Contributor: `@MridulS <https://github.com/MridulS/>`__
- Link to Proposal: `GSoC 2015: NetworkX 2.0 API <https://github.com/networkx/archive/blob/main/proposals-gsoc/GSoC-2015-NetworkX-2.0-api.md>`__
+.. _`VF2++ algorithm for graph isomorphism`: https://github.com/networkx/networkx/pull/5788
.. _`Louvain community detection algorithm`: https://github.com/networkx/networkx/pull/4929
.. _`Asadpour algorithm for directed travelling salesman problem`: https://github.com/networkx/networkx/pull/4740
.. _`Directed acyclic graphs and topological sort`: https://github.com/networkx/nx-guides/pull/44