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

20 results for “graph-based”

CS papers only

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

Want pure semantic search? Try claim verification →

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.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.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.DBcs.LOcs.PLTheoreticalRecentJun 22, 2026

A Compositional Language for Property Graphs

Marcelo Arenas, Leonid Libkin, Wim Martens

The paper proposes a solution to the lack of compositionality in graph query languages GQL and SQL/PGQ.

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 →
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 →
cs.DMTheoreticalRecentJun 14, 2026

Structural Lemmas on Temporal Connectivity

Daniele Carnevale, Arnaud Casteigts, David Schindl

This paper presents lemmas on the structure of temporal connectivity in temporal graphs.

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.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.AIRecentMay 29, 2026

Generating Graph-like Rules for Knowledge Graph Reasoning via Diffusion Models

Haoxiang Cheng, Yunfei Wang, Chao Chen, Kewei Cheng +4 more

The paper proposes GRiD, a novel framework that uses a two-phase training strategy (supervised pre-training and RL fine-tuning) to discover complex, graph-like rules for knowledge graph reasoning, ove…

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.CLcs.AIRecentJun 1, 2026

PlanarBench: Evaluating LLM Spatial Reasoning via Planar Graph Drawing

Oleksandr Nikitin

PlanarBench introduces a novel benchmark to test LLM spatial reasoning by requiring them to draw planar graphs as ASCII art from an edge list, finding that edge count is a stronger difficulty predicto…

View →
cs.LGstat.MLEmpiricalRecentJun 4, 2026

End-to-End Subgraph Detection with GraphDETR

Dexiong Chen, Till Hendrik Schulz, Karsten Borgwardt

This paper introduces GraphDETR, a deep learning framework for subgraph detection in large graphs.

View →
cs.LGcs.AIRecentMay 27, 2026

Evolutionary Refinement of Generative Graph Topologies: A Hybrid WGAN-GA Approach

James Sargant, Seyedeh Ava Razi Razavi, Renata Dividino, Sheridan Houghten

The paper introduces a hybrid WGAN-GA framework that uses a Genetic Algorithm (GA) to refine graphs generated by a GAN, significantly reducing structural deviations and improving realism.

View →
cs.DSEmpiricalRecentAug 5, 2026

Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics

Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen +1 more

This paper demonstrates that treewidth dynamic programming (TDP) can be used to enhance the performance of various graph combinatorial optimization algorithms.

View →