Cover Image

Space-time reversible graph rewriting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Arrighi, Pablo, Costes, Marin, Maignan, Luidnel
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Mathematical Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Space-time deterministic graph rewriting
by: Arrighi, Pablo, et al.
Published: (2024)

Size-varying reversible causal graph dynamics
by: Arrighi, Pablo, et al.
Published: (2018)

Causal Graph Dynamics and Kan Extensions
by: Maignan, Luidnel, et al.
Published: (2024)

Time arrow without past hypothesis: a toy model explanation
by: Arrighi, Pablo, et al.
Published: (2023)

Quantum circuit model for discrete-time three-state quantum walks on Cayley graphs
by: Sarkar, Rohit Sarma, et al.
Published: (2024)

Hypergraph rewriting and Causal structure of $λ-$calculus
by: Bajaj, Utkarsh
Published: (2024)

Beyond recognizing well-covered graphs
by: Feghali, Carl, et al.
Published: (2024)

Modelling reliability of reversible circuits with 2D second-order cellular automata
by: Vlasov, Alexander Yu.
Published: (2023)

Vertex-minor universal graphs for generating entangled quantum subsystems
by: Cautrès, Maxime, et al.
Published: (2024)

Efficient reversal of transductions of sparse graph classes
by: Dreier, Jan, et al.
Published: (2026)

Discrete functional inequalities on lattice graphs
by: Gupta, Shubham
Published: (2024)

Tree-layout based graph classes: proper chordal graphs
by: Paul, Christophe, et al.
Published: (2022)

Bakry-Émery-Ricci curvature: An alternative network geometry measure in the expanding toolbox of graph Ricci curvatures
by: Mondal, Madhumita, et al.
Published: (2024)

Multipacking and broadcast domination on cactus graph and its impact on hyperbolic graph
by: Das, Sandip, et al.
Published: (2023)

HBS Tilings Extended: State of the Art and Novel Observations
by: Porrier, Carole
Published: (2023)

Stereotype graph: A mathematical framework of category stereotypes via graph theory
by: Yan, Yijia
Published: (2025)

Graph subshifts
by: Arrighi, Pablo, et al.
Published: (2023)

The vertex visibility number of graphs
by: Roy, Dhanya, et al.
Published: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

Efficient polynomial-time approximation scheme for the genus of dense graphs
by: Jing, Yifan, et al.
Published: (2020)

Krenn-Gu conjecture for sparse graphs
by: Chandran, L. Sunil, et al.
Published: (2024)

Multipacking on graphs and Euclidean metric space
by: Islam, Sk Samim
Published: (2026)

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
by: Berthe, Gaétan, et al.
Published: (2024)

Colourful components in $k$-caterpillars and planar graphs
by: Chlebíková, Janka, et al.
Published: (2019)

Monitoring arc-geodetic sets of oriented graphs
by: Das, Tapas, et al.
Published: (2024)

Preparing graph states forbidding a vertex-minor
by: Davies, James, et al.
Published: (2025)

On arc-density of pushably $3$-critical oriented graphs
by: Das, Tapas, et al.
Published: (2025)

Greed is slow on sparse graphs of oriented valued constraints
by: Kaznatcheev, Artem, et al.
Published: (2025)

Extended formulations for induced tree and path polytopes of chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2025)

Lower bounds for dominating set reconfiguration on sparse (directed) graphs
by: Dirks, Jona, et al.
Published: (2025)

Secure Domination in Bisplit graphs -- A Structural and algorithmic study
by: D, Swathi, et al.
Published: (2025)

Approximation algorithms for job scheduling with block-type conflict graphs
by: Furmańczyk, Hanna, et al.
Published: (2022)

Infinite precedence graphs for consistency verification in P-time event graphs
by: Zorzenon, Davide, et al.
Published: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
by: Farhi, Edward, et al.
Published: (2025)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
by: Bencs, Ferenc, et al.
Published: (2023)

Optimizing Tensor Contraction Paths: A Greedy Algorithm Approach With Improved Cost Functions
by: Orgler, Sheela, et al.
Published: (2024)

Cutoff profile of the Metropolis biased card shuffling
by: Zhang, Lingfu
Published: (2022)