MotifCut
From MaRDI portal
Cited in
(13)- Quantum solutions for densest \(k\)-subgraph problems
- Top-\(k\) overlapping densest subgraphs
- The densest subgraph problem with a convex/concave size function
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity
- GOtcha
- cliques
- PRED-CLASS
- LFM-Pro
- MCODE
- Supracentrality
- Finding dense subgraphs with maximum weighted triangle density
- Subsequence-based feature map for protein function classification
- Dense subgraphs in biological networks
This page was built for software: MotifCut