Vertex labeling and routing for Farey-type symmetrically-structured graphs
From MaRDI portal
Publication:2333775
DOI10.3390/sym10090407zbMath1423.05145OpenAlexW2890335817MaRDI QIDQ2333775
Publication date: 13 November 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym10090407
Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
Combinatorial properties of Farey graphs ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
Cites Work
- Unnamed Item
- Deterministic small-world communication networks
- Statistical physics of vaccination
- Complex networks and symmetry. I: A review
- Farey graphs as models for complex networks
- A generalization of Dijkstra's algorithm
- Saving human lives: what complexity science and information systems can contribute
- Statistical physics of human cooperation
- 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
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Engineering Route Planning Algorithms
- Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
- Evolving small-world networks with geographical attachment preference
- An algorithm for finding shortest routes from all source nodes to a given destination in general networks
- Finding the K Shortest Loopless Paths in a Network
- Symmetry in complex networks
- Deterministic scale-free networks
This page was built for publication: Vertex labeling and routing for Farey-type symmetrically-structured graphs
