In search of the densest subgraph
From MaRDI portal
Publication:2005555
DOI10.3390/A12080157zbMATH Open1461.05210OpenAlexW2964670465WikidataQ127409266 ScholiaQ127409266MaRDI QIDQ2005555FDOQ2005555
Zohre R. Mojaveri, Andras Farago
Publication date: 8 October 2020
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a12080157
Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- On the structure of linear graphs
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Random graphs.
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Densest k-Subgraph Approximation on Intersection Graphs
- Algorithmic Aspects of Graph Connectivity
- Smallest-last ordering and clustering and graph coloring algorithms
- A New Algorithm for Generating All the Maximal Independent Sets
- Approximating Maximum Clique by Removing Subgraphs
- k-Degenerate Graphs
- Forests, frames, and games: Algorithms for matroid sums and applications
- Complexity of finding dense subgraphs
- A Fast Parametric Maximum Flow Algorithm and Applications
- On generating all maximal independent sets
- On colouring random graphs
- On chromatic number of graphs and set-systems
- Algorithms for maximum independent sets
- Network Analysis
- Approximating maximum independent sets by excluding subgraphs
- The densest subgraph problem with a convex/concave size function
- A general tractable density concept for graphs
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Extensions of Turán's theorem on graphs
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset
- Determination of the densest subgraph
Cited In (11)
- Targeting in networks under costly agreements
- Title not available (Why is that?)
- Discounted average degree density metric and new algorithms for the densest subgraph problem
- Finding Connected Dense $$k$$-Subgraphs
- Subgraph densities in a surface
- Greedily finding a dense subgraph
- Proximity Search for Maximal Subgraph Enumeration
- Isolation concepts for efficiently enumerating dense subgraphs
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)
- Sandwiching a densest subgraph by consecutive cores
- Computing the \(k\) densest subgraphs of a graph
This page was built for publication: In search of the densest subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005555)
