Sep 5, 2000 · We study the optimization problems of finding subgraphs maximizing these notions of density for undirected and directed graphs. This paper gives simple greedy approximation …

We study the optimization problems of finding subgraphs maxi-mizing these notions of density for undirected and directed graphs. This paper gives simple greedy approximation algorithms for …

We study the problem of finding highly connected subgraphs of undirected and directed graphs. For undirected graphs, the notion of density of a subgraph we use is the average degree of the …

algorithm to give a 2 approximation algorithm for finding a densest subgraph in directed graphs. This improves the running time from O(|V|3 + |V|2|E|) to O(|V|+ |E|). We also give a very …

The density of a graph G= (V,E) with edge capacities {c(e) : e∈E}is c(E)/|V|. Finding dense components in graphs is a major topic in graph theory algorithms. The most basic problem is …

Mar 20, 2021 · The greedy peeling algorithm, though having a worst-case performance ratio equal to 2, gives a very tight approximation on the optimal density in practice, as the average gap …

Jan 1, 2003 · We study the problem of finding highly connected subgraphs of undirected and directed graphs. For undirected graphs, the notion of density of a subgraph we use is the …

Approximation Algorithms What makes an approximation algorithm good? Speed: We usually require approximation algorithms to run in polynomial time. Accuracy: NP-completeness will …

Sep 5, 2000 · To discover dense subgraphs with good objective value, we present an iterative algorithm which runs in $\mathcal{O}(n^2k^2 + m \log n + k^3 n)$ time per single iteration, and …

Oct 1, 2020 · We propose an efficient greedy approximation algorithm for the maximum weighted triangle density problem with a provable performance. We evaluate our exact and approximate …