Detecting Triangle-Densest-K-Subgraphs with Simple Nature-Inspired Algorithms

This paper proposes two nature-inspired algorithms to solve the triangle-densest-k-subgraph problem, and compares and contrasts their results. This is one of the less studied problems in computational graph theory that can be reasonably solved with at least one of the proposed algorithms even without specific improvements made to them.