Graph downsizing: a fast heuristic for querying closely connected subgraphs.
Saved in:
| Title: | Graph downsizing: a fast heuristic for querying closely connected subgraphs. |
|---|---|
| Authors: | Liu, Yiping1,2, yliu823@aucklanduni.ac.nz, Zhang, Mengxiao1, mengxiao.zhang@uestc.edu.cnm, Liu, Jiamou2, jiamou.liu@auckland.ac.nz, Zhou, Yi1, zhou.yi@uestc.edu.cn |
| Source: | Journal of Heuristics; Mar2026, Vol. 32 Issue 1, p1-19, 19p |
| Database: | Applied Science & Technology Source |
| ISSN: | 13811231 |
|---|---|
| DOI: | 10.1007/s10732-026-09585-6 |
