Temporal k-Core Component Search (TCCS)

• TCCS is a framework that identifies cohesive subgraphs in temporal graphs under k-core constraints with explicit time windows.
• It leverages detemporalization and interval monotonicity to reduce redundant computation and improve algorithmic scalability.
• Recent methods like OTCD, CoreT, and ECB-Index offer significant speedups and storage efficiency compared to earlier techniques.

Temporal k-core component search (TCCS) studies cohesive subgraph retrieval in temporal settings under a $k$-core constraint and explicit time conditions. In one formulation, given a temporal graph, an integer $k$, a query vertex $v$, and a window $[t_s,t_e]$, the task is to return the connected component of the temporal $k$-core that contains $v$ in the snapshot over that window (Ma et al., 25 Aug 2025). Closely related formulations enumerate temporal $k$-core components over all sub-intervals of a query interval and attach each component to its supporting interval (Liu et al., 21 Aug 2025, Yang et al., 2023). A further extension realizes the same connected-$k$-core search primitive in time-dependent road-social attributed networks, where the temporal condition is expressed through departure-time-dependent travel time rather than time-varying social edges (Ni et al., 18 May 2025).

1. Problem formulations and terminology

The literature represented here uses TCCS in several closely related but not identical senses.

Setting	Input	Output
Specified-window local query (Ma et al., 25 Aug 2025)	$G$, $k$, vertex $k$0, window $k$1	The connected component of the temporal $k$2-core that contains $k$3
All-sub-interval enumeration (Liu et al., 21 Aug 2025, Yang et al., 2023)	Query interval $k$4, parameter $k$5	Temporal $k$6-core components together with supporting intervals
Time-dependent road-social query (Ni et al., 18 May 2025)	$k$7 over $k$8	A connected semantic-spatial aware $k$9-core containing $v$0

In the specified-window model, the central object is the component containing a given query vertex. In the all-sub-interval model, the objective is broader: enumerate components induced by every relevant interval inside a query range. This suggests that the term TCCS is used both for local query answering over a specified window and for exhaustive component enumeration over a query interval.

A recurrent source of confusion is the role of connectivity. In the temporal-graph formulations, connectivity is typically not required in the definition of the temporal $v$1-core itself; it is enforced only when extracting components. Both the specified-window model and the all-sub-interval model make this distinction explicit (Ma et al., 25 Aug 2025, Liu et al., 21 Aug 2025). By contrast, the road-social attributed formulation directly seeks a connected $v$2-core community containing the query node (Ni et al., 18 May 2025).

2. Structural and temporal semantics

For the specified-window temporal-graph setting, a temporal graph is an undirected graph $v$3 in which each edge $v$4 carries a timestamp $v$5. For a query time window $v$6, the windowed graph is the static subgraph

$v$7

where $v$8. The temporal $v$9-core over $[t_s,t_e]$0 is the maximal subgraph $[t_s,t_e]$1 in which every vertex has at least $[t_s,t_e]$2 neighbors; a temporal $[t_s,t_e]$3-core component is any connected component of that temporal core (Ma et al., 25 Aug 2025). The local TCCS answer is

$[t_s,t_e]$4

the connected component containing $[t_s,t_e]$5 within the induced subgraph on the temporal $[t_s,t_e]$6-core vertices.

A second line of work makes the detemporalization step explicit. Given an interval $[t_s,t_e]$7, it forms the projected temporal graph $[t_s,t_e]$8 and the detemporalized static graph

$[t_s,t_e]$9

The temporal $k$0-core over $k$1 is then the static $k$2-core of $k$3, and a temporal $k$4-core component is any connected component in that induced static $k$5-core (Liu et al., 21 Aug 2025). This formulation makes clear that repeated interactions between the same pair only affect edge availability in the aggregate graph, not multiplicity-based degree.

A key structural property is interval monotonicity. If $k$6, then

$k$7

This nested property underpins both decremental interval enumeration and core-time methods (Liu et al., 21 Aug 2025). A plausible implication is that much of TCCS algorithm design reduces to exploiting containment across overlapping intervals while avoiding duplicate component extraction.

3. Enumeration-oriented algorithms over all sub-intervals

The earliest scalable line in this group is Temporal Core Decomposition (TCD) and its optimized form OTCD. TCD enumerates subintervals row by row and decrementally induces $k$8 from previously induced temporal $k$9-cores, reducing intra-core redundant computation. OTCD adds the Tightest Time Interval (TTI), defined as the minimal interval that induces a given temporal $v$0-core, and uses TTI-based pruning rules—Pruning-on-the-Right, Pruning-on-the-Underside, and Pruning-on-the-Left—to eliminate inter-core redundant computation. The supporting data structure is the Temporal Edge List (TEL), which organizes temporal edges in a timeline and supports instant updates when new edges arrive. OTCD is reported to outperform the incremental historical k-core query by three orders of magnitude, even though it needs none precomputed index (Yang et al., 2023).

CoreT revisits temporal $v$1-core query from a core-time perspective. For a fixed start time $v$2, it records the earliest timestamp at which each vertex or edge enters a $v$3-core. Its update rules are based on the vertex-edge dependency

$v$4

and the edge-vertex-support dependency

$v$5

CoreT replaces interval-by-interval enumeration by a single pass over the query interval for each start time, with

$v$6

It achieves up to four orders of magnitude speedup compared to OTCD on large real-world datasets (Liu et al., 21 Aug 2025).

A related acceleration based on vertex core times (VCT) and minimal edge core windows (ECS) derives edge core times from

$v$7

It then enumerates all distinct temporal $v$8-cores in time

$v$9

where $k$0 is the sum over all output $k$1-cores of their number of edges. In that framework, connected components are extracted for each emitted temporal $k$2-core in total $k$3 time, so component search inherits a result-size bound (Ma et al., 19 Aug 2025). This suggests a shift from interval complexity to output complexity in recent enumeration-oriented work.

4. Historical TCCS indexing and query-time acceleration

For the specified-window local-query problem, the state-of-the-art baseline before 2025 was EF-Index, which models Temporal k-Core Evolution across windows through Tightest Time Interval (TTI), Loosest Time Interval (LTI), lineage graphs, and Minimum Temporal Spanning Forests (MTSFs). Its limitations are high computational cost and storage redundancy, because it enumerates many redundant temporal $k$4-cores and stores MTSFs per lineage chain (Ma et al., 25 Aug 2025).

The principal 2025 indexing alternative is the ECB-forest and its compressed multi-start-time realization, PECB-Index. The method reduces arbitrary-window TCCS to start-anchored TCCS by fixing $k$5 and allowing arbitrary $k$6. For fixed $k$7 and $k$8, each temporal edge receives an Edge Core Time (ECT),

$k$9

or $k$0 if it never enters the temporal $k$1-core. A core-time Minimum Spanning Forest (CT-MSF) on these edge weights preserves component connectivity, and the Edge-Centric Binary Forest (ECB-forest) further bounds traversal branching by giving each forest node at most two children.

Across all start times, PECB-Index stores only versioned neighborhood changes of ECB nodes in entries of the form $k$2. Its space is

$k$3

where $k$4 is the average number of labels per forest node, and its query time is

$k$5

where $k$6 is the number of visited forest nodes. Total construction time is

$k$7

with $k$8 the average degree and $k$9 the forest depth. Empirically, PECB-Index is 10×–1000× smaller than EF-Index on day-aggregated timestamps, achieves microsecond-level query latency comparable to EF-Index, and improves index construction cost up to 100x faster on average while maintaining high query efficiency (Ma et al., 25 Aug 2025).

5. Extensions beyond plain temporal graphs

A notable attributed generalization realizes TCCS as semantic–spatial aware $G$0-core search in a time-dependent road–social attributed network $G$1. The social layer $G$2 carries keywords and mapped locations; the road layer $G$3 carries piecewise linear travel-time functions $G$4. Given query information $G$5, the target is a connected subgraph $G$6 containing $G$7 such that $G$8 for all $G$9, while semantic cohesiveness and time-dependent spatial cohesiveness are jointly optimized. The objective terms are

$k$0

and

$k$1

combined after min–max normalization as

$k$2

The exact algorithm ESSAC enumerates connected $k$3-cores containing $k$4 locally, whereas the greedy algorithm GSSAC maintains a single evolving $k$5-core around $k$6 using the node-expansion score

$k$7

Semantic preprocessing uses GPT-3.5-Turbo and text-embedding-3-small. GSSAC yields comparable community quality to ESSAC and runs about 30× faster (Ni et al., 18 May 2025).

A different extension is the edge-based decomposition framework for temporal networks. It defines the edge-based temporal $k$8-core by requiring every temporal edge to have $k$9-degree at least $k$00, and it extracts $k$01-connected components through a static transform $k$02. The paper’s term is “$k$03-Connected Community Search (Δ-CCS),” not TCCS, but it provides a structurally analogous route from a temporal decomposition to connected component retrieval (Oettershagen et al., 2023).

The TXCQ framework generalizes temporal $k$04-core query to user-defined metrics $k$05 that are time-insensitive or time-monotonic. Phase 1 still induces all distinct $k$06-cores and locates their “time zones” through TTIs and LTIs; Phase 2 conducts local search inside each zone. For component-level search, the key observation is that the component partition of an identical temporal $k$07-core is identical throughout its zone, so only the metric value may vary with the interval (Zhong et al., 2023).

A query-centered precursor is Significant Engagement Community Search (SECS), which seeks a temporal subgraph $k$08 such that the de-temporal graph of $k$09 is a connected $k$10-core containing the query vertex $k$11, and

$k$12

is maximized. Its algorithms TDGP, BULS, BULS+, and BULS* anticipate later local-search variants of TCCS by combining connected-$k$13-core feasibility with temporal objective optimization (Zhang et al., 2022).

6. Empirical findings, applications, and open issues

Within the specified-window indexing setting, TCCS is described as critical for contact tracing, fault diagnosis, and financial forensics. PECB-Index was evaluated on 15 real-world temporal graphs from SNAP, KONECT, and Network Repository, including FB-Forum, CollegeMsg, Email, Mooc, AskUbuntu, Enron, WikiTalk, ProsperLoans, YouTube, and DBLP. On day-aggregated timestamps it is 10×–1000× smaller than EF-Index, and on fine-grained original timestamps EF-Index often fails to complete while PECB-Index builds successfully (Ma et al., 25 Aug 2025).

Within the all-sub-interval enumeration setting, CoreT was evaluated on SNAP and KONECT temporal graphs including CollegeMsg, email-Eu-core, StackExchange networks, wiki-talk, dblp-coauthor, flickr-growth, and wikipedia-growth. Example results include CollegeMsg with $k$14 and $k$15, where CoreT ran in 144 ms versus 1,054,508 ms for OTCD. On medium and large graphs, OTCD often times out at $k$16–$k$17, while CoreT completes within seconds to minutes (Liu et al., 21 Aug 2025). Earlier OTCD experiments reported that PoU and PoL prune large areas of the interval schedule, with total pruned subintervals often exceeding 80–95% (Yang et al., 2023).

Within the road-social attributed setting, experiments used five social networks—Foursquare_rec, Foursquare, Weeplace, Gowalla, and Flickr—combined with the California and North_America road networks, with 200 query nodes sampled for each composite dataset. Against spatial baselines SLDRG and LSADEN, GSSAC achieves higher coe, GPT_score, and t_coe on most datasets; against the keyword baseline ACQ, it yields comparable structural cohesiveness and higher semantic and time-dependent spatial cohesiveness. Ablation results show that removing initial construction, candidate selection, or greedy expansion degrades coe and t_coe, and replacing LLM-based processing or embeddings with direct matching reduces GPT_score substantially (Ni et al., 18 May 2025).

Several limitations recur. Many formulations assume undirected graphs, and extensions to directed or weighted settings require adapted core notions such as $k$18-core or weighted core (Ma et al., 25 Aug 2025). CoreT assumes integer timestamps and an undirected temporal graph, and its memory remains $k$19 because it stores per-edge timestamp lists (Liu et al., 21 Aug 2025). The road-social formulation evaluates temporal-spatial cohesiveness at a single departure time $k$20 rather than over a longer window $k$21, and dynamic updates and multi-query expansions are not addressed (Ni et al., 18 May 2025). In TXCQ, time-nonmonotonic user-defined metrics remain an open problem (Zhong et al., 2023).

Taken together, these results indicate a clear methodological split. One branch focuses on exact or output-sensitive enumeration of temporal $k$22-cores and then extracts components; another focuses on indexed local retrieval for arbitrary windows; and a third incorporates additional semantic, spatial, or user-defined objectives. What remains common is the same structural kernel: a connected component derived from a $k$23-core under explicit temporal semantics.