Traveling in Networks with Blinking Nodes

DOI10.20429/TAG.2018.050102MaRDI QIDQ5225540zbMATH OpenOpenAlexFDO

Authors Braxton Carrigan, James Hammer

Publication date 22 July 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2018.050102

zbMATH Keywords

blinking node systemshortest On-Hamiltonian walk

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• scientific article; zbMATH DE number 95322
• Minimization of travel time and weighted number of stops in a traffic-light network
• Periodic dynamic graphs. Random walks problem and the shortest path
• Route systems on graphs
• A method for finding Hamilton paths and Knight's tours

Cited in

(1)

• A simple network of nodes moving on the circle

This page was built for publication: Traveling in Networks with Blinking Nodes

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