arXiv (All)
open access
Finding Many Overlapping Dense Subgraphs Using Triadic Cohorts
Graphs are a standard representation for data in the social sciences, cybersecurity, computer infrastructure, bioinformatics, and more. Typical real-world graphs are sparse, meaning the average degree is small (in the tens, while the number of vertices is more than millions). When graph data is coll
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
- Median eigenvalues of subcubic graphs#612764
- Median eigenvalues of subcubic graphs#611287
- Bibliometric Analysis of Pulmonary Fibrosis Imaging Research: Knowledge Graph Construction Based on the Web of Science Core Database#405002
- Common pairs of graphs#628826
- Representing Higher-Order Networks: A Survey of Graph-Based Frameworks#85434
Record · ID 971551
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