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

20 results for “Graph”

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 →
stat.MLcs.LGEmpiricalRecentOct 25, 2026

How Much Graph Is Too Much? Graph Construction and Exposure in Spatio-Temporal Forecasting

Saj Maru, Qiyu Han, Krishna Mamidala

This paper studies the effect of graph neighbors on forecasting accuracy in spatio-temporal graph neural networks.

View →
math.COcs.DMEmpiricalRecentOct 19, 2026

Invitation to torso parameters of annotated graphs

Maël Dumas, Jędrzej Hodor, Tomasz Mazur, Piotr Micek +2 more

Defines a new method for computing annotated graph parameters such as treewidth and treedepth

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.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.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.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.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.DMTheoreticalRecentOct 19, 2026

Euclidean Embeddings of Acyclic Hypergraph Line Metrics

Nicholas Popescu

This paper studies Euclidean embeddings of higher-order line metrics arising from hypergraphs and improves the worst-case Euclidean distortion from Θ(log n) to Θ(√log log n) for α-acyclic hypergraphs.

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

How Many Slopes Does Polynomial Area Cost?

Michael A. Bekos, Eleni Katsanou, Philipp Kindermann, Maria Eleni Pavlidi

The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…

View →
cs.DScs.DMmath.COTheoreticalRecentJul 10, 2026

A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting

Amir Ali Ahmadi, Pravesh K. Kothari, Yukai Tang

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

View →
math.COcs.DMTheoreticalRecentAug 4, 2026

A directed flat wall theorem excluding a crossrow grid

Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht

The paper presents an alternative version of the directed flat wall theorem, improving upon existing ones by excluding a different digraph as a butterfly minor.

View →
math.COcs.CCTheoreticalRecentJul 21, 2026

Counting spanning quasi-trees of ribbon graphs: determinants and #P-completeness

William Whistler

This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.

View →
cs.AIRecentMay 27, 2026

DiagramRAG: A Lightweight Framework to Retrieve Scientific Diagram for Figure Generation

Xinjiang Yu, Junyi Han, Zhuofan Chen, Chi Zhang +6 more

DiagramRAG is a lightweight retrieval-augmented framework that uses reference diagrams to guide the completion of scientific diagrams from incomplete user sketches, achieving high performance on stand…

View →