Abstract: Shortest cycle counting serves as a fundamental approach for analyzing graph data,with critical applications in key node identification,periodic structure analysis,and anomaly detection.However,in temporal graph analysis,existing methods face significant challenges in efficiently supporting shortest cycle counting across varying time windows due to the temporal nature of edges and query window requirements.For this issue,an index-based solution is proposed to enhance counting efficiency firstly,which is followed by an optimized index construction strategy that reduces index size while improving construction efficiency,so as to ensure both compact index storage and efficient query processing without compromising performance.Finally,experimental results on real-world temporal graphs demonstrate that the proposed method can efficiently construct the index and rapidly retrieve the count and length of shortest cycles passing through the given query vertice within arbitrary time windows.

Key words: Temporal graph, Shortest cycle counting, Index structure, Time duration query optimization, Index construction optimization