I'm currently working on Subgraph Isomorphism challenge and saw slides and paper on MIT's website.
In the slides they mentioned Triangle Counting and k-truss. So I've been trying to úe k-trus to solve the challenge with this dataset.
My path is finding the products that are frequently purchased with a product inputting by user.
But I've ask BingAI and it said k-truss cannot solve the Subgraph Challenge.
Can you tell me if I were wrong? Or I have to use other algorithms like Bellman-Ford, etc.
Asked
Active
Viewed 16 times
-1
BewBam
- 1
- 2