20 results for “Graph”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
This paper studies the effect of graph neighbors on forecasting accuracy in spatio-temporal graph neural networks.
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
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.
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…
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.
This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.
An approach is described to support rigid α canonical variables in an e-graph.
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.
The paper proposes a solution to the lack of compositionality in graph query languages GQL and SQL/PGQ.
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…
A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.
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.
This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.
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…