Vertex labeling and routing for Farey-type symmetrically-structured graphs
DOI10.3390/SYM10090407zbMATH Open1423.05145OpenAlexW2890335817WikidataQ129226778 ScholiaQ129226778MaRDI QIDQ2333775FDOQ2333775
Authors: Yanyan Li 
Publication date: 13 November 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym10090407
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
Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Finding the K Shortest Loopless Paths in a Network
- Deterministic small-world communication networks
- Engineering Route Planning Algorithms
- Deterministic scale-free networks
- A generalization of Dijkstra's algorithm
- Title not available (Why is that?)
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- Symmetry in complex networks
- An algorithm for finding shortest routes from all source nodes to a given destination in general networks
- Statistical physics of vaccination
- Complex networks and symmetry. I: A review
- Farey graphs as models for complex networks
- Evolving small-world networks with geographical attachment preference
- Saving human lives: what complexity science and information systems can contribute
- Statistical physics of human cooperation
- Mapping Koch curves into scale-free small-world 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
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)
