arXiv (All)
open access
A Survey of Densest Subgraph Discovery on Large Graphs
With the prevalence of graphs for modeling complex relationships among objects, the topic of graph mining has attracted a great deal of attention from both academic and industrial communities in recent years. As one of the most fundamental problems in graph mining, the densest subgraph discovery (DS
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scalable Algorithm for Dynamic Quasi-clique Detection#1144814
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration#1156377
- End-to-End Subgraph Detection with GraphDETR#259474
- Cardinal-determining subgraphs of infinite graphs#490185
Record · ID 820128
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive