arXiv (OAI Expanded)
open access
Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient
In this paper, we study the problem of \emph{triangle counting} in an arbitrary anonymous graph $G$ with $n$ nodes and $m$ edges using the \emph{mobile-agent model}. Our triangle-counting method serves as a building block for solving related problems such as truss decomposition, triangle centrality,
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
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#924484
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#920253
- ClusterGraph: a new tool for visualisation and compression of multidimensional data.#362329
- On the maximum number of cyclic triples in oriented graphs#490169
- The Witness Ordinance: The Manner by Which a Matter Is Established#721747
Record · ID 1070654
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