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

20 results for “Graph burning”

CS papers only

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

Want pure semantic search? Try claim verification →

math.COcs.DMcs.GTTheoreticalRecentOct 1, 2026

Burning Signed Graphs

Shaun Fallat, Himanshu Gupta, Kamyar Khodamoradi, Sandra Zilles

A new model of graph burning is introduced, where two fires propagate along a signed graph's edges, and the goal is to burn the maximum number of vertices in a single color.

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.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 →
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 →
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 →
cs.CGcs.DMmath.COTheoreticalRecentJun 25, 2026

Unbent collections of non-planar $s$-grid-drawing

Therese Biedl

The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.

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.DScs.CCTheoreticalRecentJun 11, 2026

Sketching Intersection Profiles: A Simple Proof and Three Applications

Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi +2 more

This paper settles the complexity of three sketching problems in graphs and distributions.

View →
cs.CCcs.DMcs.DSTheoreticalRecentJul 3, 2026

Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width

Thobias Kvalvik Høivik, Erlend Raa Vågset

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…

View →
cs.DScs.CCTheoreticalRecentJul 16, 2026

Semi-Streaming Matching in a Single Pass I: A New Framework for Lower Bounds via Blueprints

Sepehr Assadi, Max Jiang, Mars Xiang

The paper develops a new framework for proving lower bounds for the maximum matching problem in the semi-streaming model, improving upon the previous best known bounds.

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.DScs.DMEmpiricalRecentNov 6, 2026

Vertex Deletion on $H$-Induced-Minor-Free Graphs: Subexponential FPT Algorithms and Approximation Schemes

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue +1 more

Improves parameterized algorithm for Feedback Vertex Set on string 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.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.DSmath.PRmath.STTheoreticalRecentJun 16, 2026

Spectral recovery of a planted triangle-dense subgraph

Sam van der Poel, Cheng Mao, Benjamin McKenna

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

View →