ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “graph processing”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.NAstat.MLTheoreticalRecentJul 30, 2026

Scalable Graph Coreset Selection via Greedy Sampling

Zhaiming Shen, Alexander Cloninger

A new graph sampling algorithm based on minimum inner product greedy selection rule is proposed, which requires only access to a small random subset of Laplacian columns and achieves sampling proporti…

View →
eess.SPcs.LGEmpiricalRecentJun 22, 2026

Low-rank Updates in Slowly Time-varying Graphs for Spatial-Temporal Signal Interpolation

Saghar Bagheri, Gene Cheung, Tim Eadie, Antonio Ortega

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…

View →
cs.DMcs.DSmath.COTheoreticalRecentJun 16, 2026

An alternative way of defining finite graphs

Maxim Nazarov

The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.

View →
cs.AIcs.DBcs.DSEmpiricalRecentJun 23, 2026

Can Aggregate Invariants Accelerate Continuous Subgraph Matching? Limits, Laws, and a Dynamic Spectral Index

Minghao Chen, Jiale Zheng

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

View →
cs.HCEmpiricalRecentJul 15, 2026

ZipLine: Visual Analysis of Multivariate Graphs with Predicate Logic

Sjoerd Vink, Suyang Li, Brian Montambault, Michael Behrisch +2 more

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

View →
cs.DCcs.DSEmpiricalRecentJul 22, 2026

Fully Dynamic Rooted Spanning Tree on GPU

Abhijeet Sahu, Harmit Singh, Soham Nandy, G. Ramakrishna

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.

View →
cs.AIRecentMay 29, 2026

GraphARC: A Comprehensive Benchmark for Graph-Based Abstract Reasoning

Saku Peltonen, August Bøgh Rønberg, Andreas Plesner, Roger Wattenhofer

The paper introduces GraphARC, a new benchmark for abstract reasoning on graph-structured data, demonstrating that current state-of-the-art language models struggle with full graph transformation task…

View →
cs.PLEmpiricalRecentJun 22, 2026

Lifting E-Graphs: A Function Isn't a Constant

Philip Zucker

An approach is described to support rigid α canonical variables in an e-graph.

View →
math.COcs.CCTheoreticalRecentJul 10, 2026

Cut-homotopies and the complexity of edge-coloring problems

Alexey Barsukov, Roman Feller, Maximilian Hadek, Davide Perinti

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

View →
cs.CGcs.DMEmpiricalRecentJul 25, 2026

How to Draw a Planar Graph: An Experimental Evaluation

Sergey Pupyrev

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

View →
cs.DScs.CCcs.DMTheoreticalRecentJun 26, 2026

Maximum Cut Algorithms and Upper Bounds for Planar and Toroidal Graphs

Mark Glass, Meir Feder

The authors map the problem of finding the maximum cut of a planar graph with arbitrary weights to a minimum T-join problem in the absolute dual graph, enabling the use of shortest paths and adapting…

View →
cs.ITTheoreticalRecentJun 11, 2026

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling

Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia

This paper identifies the fundamental limits of hypergraph edge partitioning and presents a near-optimal algorithm for a broad class of probabilistic hypergraph models.

View →
cs.CCTheoreticalRecentJul 21, 2026

On the Complexity of Graph Edit Distance in Restricted Graph Classes

Maximilian Limmer, Nils M. Kriege

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.

View →
cs.NIEmpiricalRecentJul 27, 2026

Methods for Path Set Attribute Calculation in Network Systems

Giovanni Fiaschi, Carlo Vitucci, Thomas Westerbäck, Daniel Sundmark +1 more

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.

View →