Zoltán Tasnádi

Nature Inspired Algorithms to Solve the Motif-Densest-k-Subgraph Problem

Abstract Motif detection is an essential device in the toolbox of researchers who work with interlinked data in the form of graphs. During network analysis, one can look at multiple points of interest, one of which would be a high concentration of certain properties in one part o...