Home ›
Entities
› academia
› Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China
Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China
Research article (International Journal of Geographical Information Systems, 2019) · cited 29× · AI/ML
Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China
Summary
Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China is a scholarly article[1].
Key Facts
Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China. Retrieved May 24, 2026, from https://4ort.xyz/entity/detecting-clusters-over-intercity-transportation-networks-using-k-shortest-paths-and-hierarchical-clustering-a-case-stud
MLA“Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/detecting-clusters-over-intercity-transportation-networks-using-k-shortest-paths-and-hierarchical-clustering-a-case-stud.
BibTeX@misc{4ortxyz_detecting-clusters-over-intercity-transportation-networks-using-k-shortest-paths-and-hierarchical-clustering-a-case-stud_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China}}, year = {2026}, url = {https://4ort.xyz/entity/detecting-clusters-over-intercity-transportation-networks-using-k-shortest-paths-and-hierarchical-clustering-a-case-stud}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Detecting clusters over intercity transportation networks using K-shortest paths and hierarchical clustering: a case study of mainland China — https://4ort.xyz/entity/detecting-clusters-over-intercity-transportation-networks-using-k-shortest-paths-and-hierarchical-clustering-a-case-stud (retrieved 2026-05-24)
