On f-reversible processes on graphs

DOI10.1016/J.ENDM.2015.07.039zbMATH Open1347.05182OpenAlexW2214708558MaRDI QIDQ324792FDOQ324792

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

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 algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decreasing energy functions as a tool for studying threshold networks
• Reversible iterative graph processes

Cited In (2)

• The interchange process with reversals on the complete graph
• The predecessor-existence problem for \(k\)-reversible processes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324792)