Abstract

Abstract. Given an undirected graph G = (V, E), the density of a subgraph on vertex set S is defined as d(S) = |E(S)|, where E(S) is the set of edges |S| in the subgraph induced by nodes in S. Finding subgraphs of maximum density is a very well studied problem. One can also generalize this notion to directed graphs. For a directed graph one notion of density given by Kannan and Vinay [12] is as follows: given subsets S and T of vertices, the density of the subgraph

Citations