Beyond Neighbors: Distance-Generalized Graphlets for Enhanced Graph Characterization
Graphs are widely used to model complex systems across various domains, including social networks and biological systems. A key task in graph analysis is identifying recurring structural patterns, known as graphlets, which capture connectivity among a fixed-size subset of nodes. While graphlets have been extensively applied in tasks such as measuring graph similarity and identifying communities, conventional graphlets focus only on direct connections between nodes. This limitation overlooks potential insights from more distant relationships within the graph structure.
Authors
- Kijung Shin (ORCID: https://orcid.org/0000-0002-2872-1526)
- Geon Lee (ORCID: https://orcid.org/0000-0001-6339-9758)
- Y.-D. Kim (ORCID: https://orcid.org/0000-0003-2440-9874)
- Yeongho Kim (ORCID: https://orcid.org/0009-0006-1722-6817)
Institutions
- Korea Advanced Institute of Science and Technology (KR)
Publication Details
- Published
- 2025-04-22
- DOI
- https://doi.org/10.1145/3696410.3714558
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00