Agent-Based Triangle Counting and its Applications in Anonymous Graphs

Document Type

Conference Article

Publication Title

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Aamas

Abstract

Triangle counting in graphs is a fundamental problem with a diverse application domain. In this paper, we propose a solution to the triangle counting problem in an anonymous graph using autonomous mobile agents. We further use the triangle count to address the Truss Decomposition problem which involves finding maximal sub-graphs with strong interconnections. Truss decomposition helps in identifying maximal, highly interconnected sub-graphs, or trusses, within a network. Additionally, the triangle count is also used to compute two important metrics - Triangle Centrality and Local Clustering Coefficient for the nodes of the graph. Our goal is to devise algorithms that effectively solve these problems minimizing both the overall time complexity and the memory usage at each agent.

First Page

2186

Last Page

2188

Publication Date

1-1-2024

This document is currently not available here.

Share

COinS