arXiv (All)
open access
Scalable Algorithm for Dynamic Quasi-clique Detection
Identifying dense subgraphs known as quasi-cliques is pivotal in numerous graph mining tasks across domains such as social networks, biology, and e-commerce. While prior work has developed efficient algorithms for quasi-clique detection in static graphs, real-world networks are inherently dynamic, w
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
- Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture#986789
- A Survey of Densest Subgraph Discovery on Large Graphs#820128
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
- Enumeration of regular multipartite hypergraphs#1049618
- Scalable Approximate Algorithm for Dynamic Densest Subhypergraphs with Solution-Guided Maintenance#1169674
Record · ID 1144814
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