The paper presents an algorithm for updating a Directed Minimum Spanning Tree using the weighted matroid intersection algorithm and a dynamic auxiliary graph.

This paper presents four novel parallel algorithms for maintaining a rooted spanning forest in dynamic graphs, achieving a throughput of 2 million insertions and 1.4 million deletions per second.

This paper models the changes in graph adjacency matrices over time as a low-rank matrix and develops a method for jointly interpolating signals and estimating graph adjacency matrices using this assu…

This paper studies stochastic multi-armed bandits on dynamic graphs with local movement constraints and establishes sublinear expected regret.

This paper investigates the use of spectral filtering for continuous subgraph matching over dynamic graphs and presents three key findings.

The paper proposes Dual-Scale Retentive Dynamics (DSRD), a unified framework that improves representation learning on dynamic graphs by jointly modeling evolving temporal and structural dependencies.

This paper proposes SG-JEPA, a method for learning predictive embeddings for large-scale dynamic graphs by partitioning nodes into context and target sets and encoding sequential inputs into spike cou…

This paper introduces ZipLine, a system for integrative analysis of multivariate graphs through a unified predicate language and learning algorithm.

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

This paper introduces DiPhon, a diffusion framework for size-scalable graph generation, using a continuous diffusion process on the graphon space and a discretized graph-level process.

This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.

This paper presents a method to decompose the dynamics of Boolean networks into modules using an algebraic framework.

The paper develops a general framework for dynamic consistent submodular maximization, achieving constant-factor approximations with sublinear consistency for both cardinality and rank-$k$ matroid con…

This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.

Introduces Expanding Generative Flows (EFlows) and Expanding Flow Maps (EFMs) for generating outputs of varying sizes in continuous and discrete state spaces.