Traveling in Networks with Blinking Nodes

DOI10.20429/TAG.2018.050102zbMATH Open1416.05260OpenAlexW2783076134MaRDI QIDQ5225540FDOQ5225540

Authors: Braxton Carrigan, James Hammer 

Publication date: 22 July 2019

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

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

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

zbMATH Keywords

blinking node systemshortest On-Hamiltonian walk

Mathematics Subject Classification ID

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

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)