Vertex labeling and routing for Farey-type symmetrically-structured graphs

DOI10.3390/SYM10090407MaRDI QIDQ2333775zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 13 November 2019

Published in Symmetry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/sym10090407

zbMATH Keywords

complex networksvertex labelingshortest path routingdeterministic modelsFarey-type graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Vertex labeling and routing in expanded Apollonian networks
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs
• Farey graphs as models for complex networks
• Rainbow vertex-connection number on a small-world Farey graph

Cites work

• scientific article; zbMATH DE number 1875406 (Why is no real title available?)
• A generalization of Dijkstra's algorithm
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• An algorithm for finding shortest routes from all source nodes to a given destination in general networks
• Complex networks and symmetry. I: A review
• Deterministic scale-free networks
• Deterministic small-world communication networks
• Engineering Route Planning Algorithms
• Evolving small-world networks with geographical attachment preference
• Farey graphs as models for complex networks
• Finding the K Shortest Loopless Paths in a Network
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs
• Mapping Koch curves into scale-free small-world networks
• More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
• Saving human lives: what complexity science and information systems can contribute
• Statistical physics of human cooperation
• Statistical physics of vaccination
• Symmetry in complex networks
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks

Cited in

(4)

• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
• Combinatorial properties of Farey graphs
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs
• Vertex labeling and routing in expanded Apollonian networks

This page was built for publication: Vertex labeling and routing for Farey-type symmetrically-structured graphs

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