20 results for “Graph burning”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.
This paper studies the effect of graph neighbors on forecasting accuracy in spatio-temporal graph neural networks.
A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.
The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.
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.
This paper settles the complexity of three sketching problems in graphs and distributions.
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…
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.
An approach is described to support rigid α canonical variables in an e-graph.
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue +1 more
Improves parameterized algorithm for Feedback Vertex Set on string graphs
This paper investigates the use of spectral filtering for continuous subgraph matching over dynamic graphs and presents three key findings.
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…
This paper identifies the fundamental limits of hypergraph edge partitioning and presents a near-optimal algorithm for a broad class of probabilistic hypergraph models.
This paper studies the triangle-densest-$k$-subgraph problem in an average-case model and proposes spectral and semidefinite algorithms for its recovery.