On \(f\)-reversible processes on graphs

DOI10.1016/J.ENDM.2015.07.039zbMath1347.05182OpenAlexW2214708558MaRDI QIDQ324792

Mitre C. Dourado, Carlos Vinícius G. C. Lima, Jayme Luiz Szwarcfiter

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.039

zbMATH Keywords

complexity\(f\)-conversion set problem\(f\)-reversible processesgraph dynamical systemsmaximum transient length

Mathematics Subject Classification ID

Convex programming (90C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversible iterative graph processes
• Decreasing energy functions as a tool for studying threshold networks

This page was built for publication: On \(f\)-reversible processes on graphs