Obtaining communities with a fitness growth process

► We define a growth process for a fitness function to find a local community. ► We establish a cutting technique that extracts a community partition from it. ► By using efficient data structures the algorithmic complexity is reduced. ► The results are contrasted with those of global methods on heterogeneous networks. ► We explain why global methods tend to fail on these networks.