This paper proves lower bounds for the size of multiplicative graph spanners in the $f$-degree fault tolerant model, matching previous conditional lower bounds and current upper bounds.

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

A new solver-free parallel spectral sparsification algorithm for weighted graphs is presented, relying on low-diameter decompositions and independent sampling, eliminating dependence on target approxi…

The paper proposes a graph-constrained approach to scale multi-hop training data by decoupling path discovery from path verbalization, significantly expanding the usable corpus size for LLMs.

This paper proposes a scalable topological learning framework for higher-order graph representation by introducing simplified and factored cellular Weisfeiler Leman tests and a novel random walk metho…

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.

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

The paper introduces TN-SHAP-G, a novel framework that uses graph-structured tensor networks to efficiently approximate and compute Shapley values and interaction indices for black-box models, overcom…

This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.

This paper presents three new algorithms for maximizing revenue in the Stackelberg Vertex Cover problem on certain kinds of trees.

This paper studies the triangle-densest-$k$-subgraph problem in an average-case model and proposes spectral and semidefinite algorithms for its recovery.

The paper investigates the relationship between graph classes, edit cost functions, and computational complexity of the graph edit distance, providing polynomial-time reductions and correspondences.

This paper studies the maximum size of an independent set in the discrete simplex graph and provides new bounds using translated smaller graphs and finite rational linear systems.

This paper improves the time complexity of exact algorithms for converting a connected graph into a cactus by reducing it from O*(3^n) to O*(2^n) for unweighted graphs, and provides faster algorithms…