In search of the densest subgraph
From MaRDI portal
Publication:2005555
DOI10.3390/A12080157zbMath1461.05210OpenAlexW2964670465WikidataQ127409266 ScholiaQ127409266MaRDI QIDQ2005555
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
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general tractable density concept for graphs
- On generating all maximal independent sets
- Forests, frames, and games: Algorithms for matroid sums and applications
- Approximating maximum independent sets by excluding subgraphs
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Complexity of finding dense subgraphs
- The densest subgraph problem with a convex/concave size function
- Determination of the densest subgraph
- Detecting high log-densities
- Densest k-Subgraph Approximation on Intersection Graphs
- Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset
- Algorithmic Aspects of Graph Connectivity
- Smallest-last ordering and clustering and graph coloring algorithms
- Algorithms for maximum independent sets
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- On colouring random graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- Approximating Maximum Clique by Removing Subgraphs
- A Fast Parametric Maximum Flow Algorithm and Applications
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- On chromatic number of graphs and set-systems
- k-Degenerate Graphs
- Network Analysis
- Extensions of Turán's theorem on graphs
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- On the structure of linear graphs
This page was built for publication: In search of the densest subgraph
