This project hosts the code for finding densest common subgraph in a relational graph set. For more details, please see the following poster and the accompanying paper.
-
Notifications
You must be signed in to change notification settings - Fork 0
Code for finding dense subgraphs in relational graphs
License
vjethava/DensestCommonSubgraph.jl
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Code for finding dense subgraphs in relational graphs
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published