Skip to content
Log in
Sponsored Design Multi-Agent AI Systems Using MCP and A2A: Engineer your own Pyt Design Multi-Agent AI Systems Using MCP and A2A: Engineer your own Pyt

Similar papers

Jul 2026

Worst-Case Optimal BGPs on Temporal Graphs

An index structure that, for a temporal graph with N edges, requires O(N) space and can evaluate extended BGPs in wco time and yields wco guarantees for related query types, including snapshot evaluation, version queries, and other temporal variants.

Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro et al. · 0 citations
Aug 2026

Cedar: A Columnar LSM-Engine for Temporal Property Graphs

Interactions among real-world entities can be modeled using temporal graphs, which evolve dynamically over time. Ensuring efficient storage and queries in graph databases is challenging. In this paper, we design and demonstrate Cedar, an LSM-tree-based columnar engine for temporal graphs. Firstly, Cedar unifies vertice...

Yang Wang, Xue-Lian Lin, Jing-He Song et al. · 0 citations
Preprint Aug 2026

Uplifting the Superpowers of Worst-Case-Optimal Join Algorithms

This paper shows how to uplift wco join algorithms so as to incorporate such filtering natively, improving efficiency and demonstrates the superiority of this approach by extending the Ring -- a compact index that provides wco resolution of BGPs within almost no extra space on top of the graph -- so as to handle proper...

Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro · 0 citations
Book Open access Aug 2026

Efficient Simple Temporal Cycle Enumeration on Large Graphs with Lightweight Preprocessing

This work introduces a novel edge-centric framework that treats temporal edges as the core units of exploration and eliminates redundant temporal checks, and extends this framework to dynamic settings by introducing an efficient incremental update algorithm that selectively identifies affected paths only.

Qi Liang, Dian Ouyang, Kang Chen et al. · 0 citations
Oct 2025

Effective Durable Community Search in Large Temporal Graph

A novel community model, called temporal durable community (TDC), which is the temporal k -core with the longest duration in the temporal graph, is introduced, and two index structures that can quickly determine the duration of a given temporal k -core are developed, followed by query algorithms.

Ying-Li Zhou, Yi-Ge Jiang, Yixiang Fang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.