Interest along Weisfeiler-Leman Graph Isomorphism Test

Open
#451 2 comments 1 reaction 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
cpp
Domain
data

Research direction

Start by reading the existing isomorphism() and vf2_sub_graph_iso() entry points, then review the linked Weisfeiler–Leman literature to define the algorithm's scope and API. The issue does not name files, tests, supported graph types, or acceptance criteria; done would require agreeing on those details and adding the test coverage and documentation needed for a usable complement to the existing algorithms.

Written by the indexing model from the issue text.

Description

algorithm

Hi Graphies,

I received a feature request from a graph scientist: the Weisfeiler-Leman (WL) graph isomorphism test, a popular heuristic for detecting non-isomorphic graphs. From what I understand, WL quickly proves non-isomorphism in polynomial time, so one can skip exponential exact algorithm most of the time. So it should problably complement existing BGL algorothms like:

  • isomorphism() Exact algorithm, worst-case exponential time
  • vf2_sub_graph_iso() Subgraph matching, even slower

Literature

What do you think ?

Dominant language
C++
Stars
395
Forks
239
Avg merge
18h 50m
Merged PRs (30d)
20

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from boostorg/graph

All issues in boostorg/graph

Similar issues

More C++ issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.