The calculation of the subgraph with the maximal pseudo-density

In this paper a new approach to effective calculation of a subgraph with the maximal density has been found. A pseudo-density is defined as the |E|/|V| ratio of the G = (V, E) graph. The use for solving consecutive scheduling problem is considered.