Skip to main content
Applied Network Science
Fig. 1 | Applied Network Science

Fig. 1

From: A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks

Fig. 1

Workflow of the proposed approach. In the first step the input conceptual and physical networks are merged together using a network alignment approach; then Weighted-Top-k-Overlapping DCS is applied on the alignment graph. Each extracted subgraph induces a connected subgraph in the physical network and one of the top-k overlapping weighted densest subgraph in the conceptual one

Back to article page