Dense subgraph discovery seeks to identify tightly knit groups of vertices within a larger network by maximising a chosen density measure, most often the ratio of edges to vertices or the average ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results