Pith. sign in

REVIEW 4 major objections 5 minor 60 references

The Trade-Off between Directness and Coverage in Transport Network Growth

T0 review · 4 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Hand-built link orders beat greedy and random growth on both metrics.

desk verdict Useful systematic comparison of network growth strategies, with open code, but the 'manual beats greedy' claim rests on unproven optimality of two hand-designed orders. read the letter →

arxiv 2507.13005 v1 pith:SPFJAIIM submitted 2025-07-17 physics.soc-ph

Clément Sebastiao , Anastassia Vybornova , Ane Rahbek Vier{o} , Luca Maria Aiello , Michael Szell This is my paper
classification physics.soc-ph
keywords linkorderingtransportnetworkgrowthdirectnesscoveragegreedyalgorithmplanarnetworksbicycleevolution
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper asks: given a planned final transport network, in what order should links be built so the network is already useful while under construction? It compares random, greedy, and human-designed link-ordering strategies on stylized connected planar networks, scoring each growth curve by area under the curve for directness and coverage. The central finding is a ranking: hand-designed orders achieve the best trade-off, greedy optimization is intermediate but metric-dependent, and random orders are so far from the efficient frontier that brute-force random search would need hundreds of millions of trials. Greedy strategies aimed directly at directness fall into local optimum traps, while coverage-maximizing greedy reaches full coverage quickly but then drifts to random directness. The result matters because bicycle and other sustainable transport networks are built incrementally over decades, so the order of construction determines how early the network becomes usable.

What carries the argument

The central object is a link ordering strategy: an algorithm that takes the final planar network and outputs a permutation of its links, and the paper evaluates each strategy by the area under the curve (AUC) of its coverage and directness trajectories over normalized built length. Directness is the average ratio of Euclidean to shortest-path distance over all node pairs; coverage is the area of buffered built links. The comparison engine is a set of additive greedy algorithms—at each step adding the link that maximizes the chosen metric while keeping the network connected, with random tie-breaking—plus two hand-designed orders that the authors argue are globally optimal for coverage and directness on the regular grid, and a hierarchical heuristic. AUC in coverage-directness space is what converts growth curves into a single ranking and lets the paper identify the Pareto front.

What would settle it

For the 10×10 grid, solve the link-ordering problem exactly with an integer program or branch-and-bound search that maximizes the area under the curve of coverage or directness over all permutations of the 180 links, and compare those exact optima with the AUC values reported for manual orders C and D; if either exact optimum differs from the reported manual value, the claim that manual orders are upper bounds and therefore beat greedy strategies would be falsified.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central claim is that for connected planar networks with a fixed final link set, the choice of growth strategy creates a nontrivial directness-coverage trade-off: manual orders C and D, hand-designed as upper bounds for coverage and directness on a regular grid, dominate greedy strategies on both AUC metrics; greedy directness, closeness, and betweenness strategies sit on or near the Pareto front for directness but sacrifice coverage; and random ordering is effectively a lower bound, six standard deviations from the Pareto front. Coverage-based greedy strategies attain maximal coverage AUC as fast as possible but perform no better than random on directness, and directness-based greedy gets trapped in local optima because long cycles are hard to complete. The same qualitative ranking holds across a grid with a diagonal, a three-bridges network, and a radio-concentric network, and the ranking persists under grid distortion and exponential discounting of early growth stages.

Load-bearing premise

The ranking depends on the claim that the hand-designed orders C and D are globally optimal upper bounds for coverage and directness on the regular grid; the paper asserts this optimality without proof, and for the other test networks it makes no global-optimality claim at all.

Editorial extensions

If this is right

  • If the central claim holds, a planner with a fixed final network should prefer a global, hand-designed or hierarchical link order over per-step greedy optimization: it yields higher directness and coverage throughout construction, not just at the end.
  • Coverage-greedy orders should be used when reaching full geographic coverage early is the priority, but they should be followed by a directness-oriented phase, because after full coverage they behave like random choice and sacrifice directness.
  • Directness-greedy orders will underperform on directness itself on grid-like networks because they are trapped by local optima; centrality-based greedy strategies are a better directness heuristic, though they sacrifice coverage.
  • Additive (forwards) growth should be preferred to subtractive (backwards) growth on these stylized networks, since no subtractive strategy reaches the Pareto front except centrality-based ones—a caution against recent subtractive design methods.
  • Random construction, which can arise from fragmented local decision-making in real cities, is far from Pareto efficient: brute-forcing random orders would need on the order of 500 million trials to get close to the front.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper only tests stylized topologies with homogeneous node distributions; a natural extension is to empirical street networks with nonuniform population and destinations, where coverage should be weighted by actual demand rather than raw buffer area, and the paper notes the all-to-all directness computation would scale as O(L^5).
  • The 'manual beats greedy' result suggests a step-dependent objective—start with coverage-greedy growth, then switch to a directness-focused manual ordering—may be a practical design recipe; the paper mentions this switch as a possible improvement but does not implement it.
  • The buffer size of 1.5 link lengths is a single modeling choice, and the paper shows the number of links needed for full coverage swings from 20% to 100% of links as buffer size changes; re-running the strategy ranking across buffer sizes would test whether the ordering of strategies is an artifact of this choice.
  • Because directness-greedy growth is computationally expensive and still falls into local traps, the paper's result that cheap centrality heuristics beat directness-greedy suggests surrogate metrics could capture most of the benefit at far lower computational cost.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper studies the order in which links of a fixed connected planar transport network should be built so that the growing network is functional early. It defines coverage and directness metrics, compares random ordering, six greedy strategies (coverage, adaptive coverage, directness, relative directness, closeness, betweenness), and three hand-designed manual orders (H, C, D) on a 10x10 grid and three other stylized networks. Performance is summarized by normalized area under the curve (AUC). The main findings are that random orders are far from the Pareto front; greedy strategies vary widely, with centrality-based strategies doing well on directness but poorly on coverage and coverage-based strategies doing the opposite; manual orders C and D sit on the Pareto front and outperform greedy strategies on the grid; and additive strategies generally outperform subtractive ones. The authors report robustness of the main ordering to grid distortions and to exponential discounting of early growth.

Significance. If substantiated, the paper provides a useful quantitative ranking of link-ordering strategies for transport network growth, with direct relevance to bicycle network planning. Its strengths include open reproducible code, a systematic comparison across four stylized urban topologies, and explicit robustness checks (distorted grids, exponential discounting). The central caveat is that the headline 'manual beats greedy' claim rests on the asserted but unproven global optimality of two hand-designed orders on the regular grid. This makes the paper's conclusions conditional rather than fully established, but the underlying empirical comparison of random and greedy strategies is sound and reproducible.

major comments (4)
  1. [2.3, 3.2] The claim that manual orders C and D are globally optimal is asserted without proof. Section 2.3 states 'We are able to design globally optimal manual orders for the regular grid,' and Section 3.2 treats the Pareto-front placement of C and D as 'expected since we designed them to be optimal strategies.' However, no certificate, exhaustive check, or formal argument is provided, and the same section concedes that global optimality cannot be argued for the other test networks. This premise is load-bearing: the conclusion that manual strategies beat greedy ones depends on C and D being true optima rather than merely well-tuned heuristics. The composite rule in manual order C (switching to order H after full coverage) is also not separately justified as optimal. Please either supply a proof or verification (for example, a branch-and-bound or exhaustive check on a smaller grid, or a comparison against a stronger metaheuristic such as simulated annealing) or rephrase the claims as 'hand-designed heuristic strategies' and soften the 'upper bound' language throughout.
  2. [Abstract, 3.3, 4] The abstract says that coverage-based greedy strategies 'can achieve maximum global coverage as fast as possible,' but Section 3.3 reports that manual order C reaches full coverage with 48 links (27% of 180) whereas the additive Coverage strategy needs 58 links (32%). This is internally inconsistent unless 'as fast as possible' is explicitly restricted to greedy strategies. The same wording appears in the Discussion. Please clarify or correct the claim.
  3. [Abstract, 3.2, 3.7] The abstract's claim that 'manual strategies fare better than greedy strategies on both metrics' is stronger than the reported data. Section 3.2 itself notes that the Directness greedy strategy has slightly more AUC of directness than manual order H and that the Closeness strategy has slightly more AUC of coverage than manual order D. Moreover, manual orders are constructed only for the regular grid; Section 3.7 runs only random and greedy strategies on the other three networks. The cross-network claim should be restricted to the greedy-versus-random comparison, and the manual-versus-greedy claim should be limited to the grid or to the specific manual strategies C and D on their respective target metrics.
  4. [3.1] The statement that the average random order is 'at least six standard deviations away from the front for each axis' needs a precise definition of distance to the Pareto front. The front is a curve in the (AUC of directness, AUC of coverage) plane, so 'each axis' is ambiguous. The subsequent claim that about 500 million random trials would be needed also assumes normality for the distance statistic, while the Shapiro-Wilk test is reported only for the coverage marginal. Please replace this with a directly defined statistic, for example the fraction of random runs falling within a fixed neighborhood of the Pareto front, and report its distribution.
minor comments (5)
  1. [2.2, Eq. (1)] The expression for the buffered link area appears to contain a typographical or formatting error ('2ld + 21 2πd2'); the intended formula is presumably 2ld + πd^2. Please check and correct.
  2. [2.2, 3.5] The adaptive-coverage threshold (0.1), the initial buffer size (300 m), and the halving rule are chosen heuristically. Since Section 3.5 shows that the choice of buffer size materially affects the results, a brief sensitivity analysis for these parameters, or at least an explicit statement that they are calibrated choices, would strengthen the paper.
  3. [3.3] The text says that the additive Coverage strategy reaches full coverage with 58 links (32%) and then states that 'every link added after the first 59 is chosen at random.' The off-by-one discrepancy should be reconciled.
  4. [3.2, Fig. 6] The caption of Fig. 6 says the Pareto front is 'computed for all considered orders,' but it is not clear whether this includes all single runs or only per-strategy average curves. Please define this precisely.
  5. [Declarations] The software repositories are cited by URL without a version identifier or DOI; adding a versioned release or archive would improve reproducibility.

Circularity Check

1 steps flagged · score 2.0 of 10

Manual orders C and D are constructed to optimize the evaluated metrics, so their Pareto-front placement is by design; the rest of the comparison is independent.

  1. self definitional [Section 2.3 (Manual coverage order C / Manual directness order D) and Section 3.2]
    "The manual coverage order “C” is providing the upper bound for coverage, for the fixed buffer size of 1.5 times the link length. ... The manual directness order “D” is providing the upper bound for directness. ... The manual orders C and D lie on the Pareto Front, which was expected since we designed them to be optimal strategies."

    C and D are hand-designed to maximize the exact metrics (coverage and directness) used later for evaluation, so their membership on the Pareto front restates the design objective rather than being an independent finding. The headline ranking 'manual beats greedy' draws on this by-construction optimality for the C/D branch; only the hierarchical order H provides independent manual evidence. The greedy-versus-random and greedy-versus-greedy comparisons remain independent simulations, so the circularity is limited and does not invalidate the main quantitative comparisons.

full rationale

The core comparison is a simulation study with transparent inputs: random, greedy, and manual strategies are defined in Sections 2.1–2.3 and evaluated by coverage/directness AUC in Section 3. The greedy and random results are independent of the manual orders and are not fitted to them. The one by-construction element is that manual orders C and D are explicitly designed to be optimal for the evaluation metrics; the paper itself marks their Pareto-front placement as 'expected since we designed them to be optimal strategies.' This makes the manual-vs-greedy margin for those two orders an input rather than a discovery, but it is not a hidden circularity because the paper discloses the design and the hierarchical order H independently lands on the Pareto front. Self-citations (e.g., Szell et al. 2022 for metric definitions) are standard and not load-bearing. No equation is derived from another by construction, and no fitted parameter is renamed as a prediction. Score 2 reflects the minor by-construction element without treating the paper's empirical comparisons as circular.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The central claims rest on standard network centrality definitions and simulation parameters. The main free parameters are the coverage buffer size and adaptive coverage thresholds, which are hand-chosen. The most fragile premise is the unproven global optimality of the manual orders, which underpins the headline ranking.

free parameters (3)
  • Coverage buffer size d = 150 meters (1.5x link length)
    Chosen as an 'intermediate' buffer size; coverage values and rankings depend on this choice. The paper tests extremes (50m, 450m) but does not vary it systematically.
  • Adaptive coverage threshold r = 0.1
    Hand-set threshold for halving the buffer size in adaptive coverage. No sensitivity analysis is provided.
  • Initial buffer size for adaptive coverage = 300 meters, halved to 150 and 75
    Chosen arbitrarily to illustrate multi-scale growth; affects when full coverage is reached (101 links vs 59 for fixed buffer).
assumptions (4)
  • domain assumption The networks are planar and spatial, and connectedness is required at all growth stages.
    Section 2.2 imposes connectedness to avoid trivial disconnected coverage; planarity is motivated by urban street networks (Boeing 2020).
  • domain assumption Coverage is measured as the area of buffered links with a fixed buffer size, assuming homogeneous distribution of population or points of interest.
    Section 2.2 defines coverage this way and explicitly acknowledges the homogeneity assumption.
  • domain assumption Directness is computed for all-to-all node pairs, not a specific origin-destination matrix.
    Section 2.2 justifies this to avoid arbitrary OD selection, but it may not reflect real usage patterns.
  • ad hoc to paper The manual orders C and D are globally optimal upper bounds for coverage and directness on the regular grid.
    Section 2.3 asserts global optimality without proof. This is a strong premise for the 'manual beats greedy' claim.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Trade-Off between Directness and Coverage in Transport Network Growth." pith.science (2026). https://pith.science/paper/SPFJAIIM

@misc{pith2026250713005,
  author       = {Pith},
  title        = {Pith review of: The Trade-Off between Directness and Coverage in Transport Network Growth},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SPFJAIIM}},
  note         = {Machine review of arXiv:2507.13005}
}
read the original abstract

Designing spatial networks, such as transport networks, commonly deals with the problem of how to best connect a set of locations through a set of links. In practice, it can be crucial to order the implementation of the links in a way that facilitates early functioning of the network during growth, like in bicycle networks. However, it is unclear how this early functional structure can be achieved by different growth processes. Here, we systematically study the growth of connected planar networks, quantifying functionality of the growing network structure. We compare random growth with various greedy and human-designed, manual growth strategies. We evaluate our results via the fundamental performance metrics of directness and coverage, finding non-trivial trade-offs between them. Manual strategies fare better than greedy strategies on both metrics, while random strategies perform worst and are unlikely to be Pareto efficient. Centrality-based greedy strategies tend to perform best for directness but are worse than random strategies for coverage, while coverage-based greedy strategies can achieve maximum global coverage as fast as possible but perform as poorly for directness as random strategies. Directness-based greedy strategies get stuck in local optimum traps. These results hold for a number of stylized urban transport network topologies. Our insights are crucial for applications where the order in which links are added to a spatial network is important, such as in urban or regional transport network design problems.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

60 extracted references · 56 canonical work pages

  1. [1]

    , Natera Orozco , L.G

    barticle Alessandretti , L. , Natera Orozco , L.G. , Saberi , M. , Szell , M. , Battiston , F. : Multimodal urban mobility and multilayer transport networks . Environment and Planning B: Urban Analytics and City Science 50 ( 8 ), 2038 -- 2070 ( 2023 ) barticle

    work page 2023

  2. [2]

    : Spatial Networks: a Complete Introduction : from Graph Theory and Statistical Physics to Real-world Applications

    bbook Barthelemy , M. : Spatial Networks: a Complete Introduction : from Graph Theory and Statistical Physics to Real-world Applications . Springer , Cham ( 2022 ). 10.1007/978-3-030-94106-2 bbook

    work page doi:10.1007/978-3-030-94106-2 2022

  3. [3]

    : Hierarchy in cities and city systems

    barticle Batty , M. : Hierarchy in cities and city systems . Hierarchy in natural and social sciences 3 , 143 -- 168 ( 2006 ) barticle

    work page 2006

  4. [4]

    : The New Science of Cities

    bbook Batty , M. : The New Science of Cities . MIT press , ??? ( 2013 ) bbook

    work page 2013

  5. [5]

    , Bordin , P

    barticle Barthelemy , M. , Bordin , P. , Berestycki , H. , Gribaudi , M. : Self-organization versus top-down planning in the evolution of a city . Scientific Reports 3 ( 1 ), 2153 ( 2013 ) 10.1038/srep02153 barticle

    work page doi:10.1038/srep02153 2013

  6. [6]

    , Gherardi , M

    barticle Bottinelli , A. , Gherardi , M. , Barthelemy , M. : Efficiency and shrinking in evolving networks . Journal of The Royal Society Interface 16 ( 154 ), 20190101 ( 2019 ) 10.1098/rsif.2019.0101 barticle

    work page arXiv 2019

  7. [7]

    , Le , V.B

    bbook Brandst \"a dt , A. , Le , V.B. , Spinrad , J.P. : Graph Classes: a Survey . SIAM , ??? ( 1999 ) bbook

    work page 1999

  8. [8]

    : Osmnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks

    barticle Boeing , G. : Osmnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks . Computers, environment and urban systems 65 , 126 -- 139 ( 2017 ) barticle

    work page 2017

Show all 60 references
  1. [9]

    : Planarity and street network representation in urban form analysis

    barticle Boeing , G. : Planarity and street network representation in urban form analysis . Environment and Planning B: Urban Analytics and City Science 47 ( 5 ), 855 -- 869 ( 2020 ) barticle

    2020

  2. [10]

    : Topological graph simplification solutions to the street intersection miscount problem

    barticle Boeing , G. : Topological graph simplification solutions to the street intersection miscount problem . Transactions in GIS 29 ( 3 ), 70037 ( 2025 ) barticle

    2025

  3. [11]

    , Raubal , M

    barticle Ballo , L. , Raubal , M. , Axhausen , K.W. : Designing an e-bike city: An automated process for network-wide multimodal road space reallocation . Journal of Cycling and Micromobility Research 2 , 100048 ( 2024 ) barticle

    2024

  4. [12]

    : Coordinated and uncoordinated optimization of networks

    barticle Brede , M. : Coordinated and uncoordinated optimization of networks . Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 81 ( 6 ), 066104 ( 2010 ) barticle

    2010

  5. [13]

    , Leiserson , C.E

    bbook Cormen , T.H. , Leiserson , C.E. , Rivest , R.L. , Stein , C. : Introduction to Algorithms . MIT press , ??? ( 2022 ) bbook

    2022

  6. [14]

    , Olafsson , A.S

    barticle Carstensen , T.A. , Olafsson , A.S. , Bech , N.M. , Poulsen , T.S. , Zhao , C. : The spatio-temporal development of Copenhagen ’s bicycle infrastructure 1912–2013 . Geografisk Tidsskrift-Danish Journal of Geography 115 ( 2 ), 142 -- 156 ( 2015 ) 10.1080/00167223.2015....

    1912

  7. [15]

    : The City of To-morrow and Its Planning (1929) botherref

    botherref Corbusier , L. : The City of To-morrow and Its Planning (1929) botherref

    1929

  8. [16]

    CROW (2016) botherref

    botherref CROW : Design Manual for Bicycle Traffic. CROW (2016) botherref

    2016

  9. [17]

    , Sol \'e , R.V

    bchapter Cancho , R.F.i. , Sol \'e , R.V. : Optimization in complex networks . In: Statistical Mechanics of Complex Networks , pp. 114 -- 126 . Springer , ??? ( 2003 ) bchapter

    2003

  10. [18]

    , Scellato , S

    barticle Cardillo , A. , Scellato , S. , Latora , V. , Porta , S. : Structural properties of planar graphs of urban street patterns . Physical Review E 73 ( 6 ), 066107 ( 2006 ) 10.1103/PhysRevE.73.066107 . Publisher: American Physical Society . Accessed 2022-03-16 barticle

    2006 doi

  11. [19]

    , Rincón-Acosta , C

    barticle El Gouj , H. , Rincón-Acosta , C. , Lagesse , C. : Urban morphogenesis analysis based on geohistorical road data . Applied Network Science 7 ( 1 ), 6 ( 2022 ) 10.1007/s41109-021-00440-0 barticle

    2022 doi

  12. [20]

    , Marshall , W.E

    botherref Ferenchak , N.N. , Marshall , W.E. : The link between low-stress bicycle facilities and bicycle commuting. Nature Cities, 1--5 (2025) botherref

    2025

  13. [21]

    , Miandoabchi , E

    barticle Farahani , R.Z. , Miandoabchi , E. , Szeto , W.Y. , Rashidi , H. : A review of urban transportation network design problems . European journal of operational research 229 ( 2 ), 281 -- 302 ( 2013 ) barticle

    2013

  14. [22]

    , Skamris Holm , M.K

    barticle Flyvbjerg , B. , Skamris Holm , M.K. , Buhl , S.L. : How (in) accurate are demand forecasts in public works projects?: The case of transportation . Journal of the American planning association 71 ( 2 ), 131 -- 146 ( 2005 ) barticle

    2005

  15. [23]

    , Vybornova , A

    botherref Fleischmann , M. , Vybornova , A. , Gaboardi , J.D. , Br \'a zdov \'a , A. , Dan c ejov \'a , D. : Adaptive continuity-preserving simplification of street networks. arXiv preprint arXiv:2504.16198 (2025) botherref

    2025 arXiv

  16. [24]

    , Levinson , D.M

    barticle Giacomin , D.J. , Levinson , D.M. : Road network circuity in metropolitan areas . Environment and Planning B: Planning and Design 42 ( 6 ), 1040 -- 1053 ( 2015 ) 10.1068/b130131p barticle

    2015 doi

  17. [25]

    , Newman , M.E.J

    barticle Girvan , M. , Newman , M.E.J. : Community structure in social and biological networks . Proceedings of the National Academy of Sciences 99 ( 12 ), 7821 -- 7826 ( 2002 ) 10.1073/pnas.122653799 barticle

    2002 doi

  18. [26]

    : Why cities need to take road space from cars-and how this could be done

    barticle G \"o ssling , S. : Why cities need to take road space from cars-and how this could be done . Journal of Urban Design 25 ( 4 ), 443 -- 448 ( 2020 ) barticle

    2020

  19. [27]

    , Wilson , R.J

    barticle Hopkins , B. , Wilson , R.J. : The Truth about K \"o nigsberg . The College Mathematics Journal 35 ( 3 ), 198 -- 207 ( 2004 ) 10.1080/07468342.2004.11922073 barticle

    2004

  20. [28]

    , Barbosa , H

    barticle Kirkley , A. , Barbosa , H. , Barthelemy , M. , Ghoshal , G. : From the betweenness centrality in street networks to structural invariants in random planar graphs . Nature communications 9 ( 1 ), 2501 ( 2018 ) barticle

    2018

  21. [29]

    : Sur le probleme des courbes gauches en topologie

    barticle Kuratowski , C. : Sur le probleme des courbes gauches en topologie . Fundamenta mathematicae 15 ( 1 ), 271 -- 283 ( 1930 ) barticle

    1930

  22. [30]

    , Furth , P

    barticle Lowry , M.B. , Furth , P. , Hadden-Loh , T. : Prioritizing new bicycle facilities to improve low-stress network connectivity . Transportation Research Part A: Policy and Practice 86 , 124 -- 140 ( 2016 ) 10.1016/j.tra.2016.02.003 barticle

    2016 doi

  23. [31]

    , Jensen , P

    barticle Louf , R. , Jensen , P. , Barthelemy , M. : Emergence of hierarchy in cost-driven growth of spatial networks . Proceedings of the National Academy of Sciences 110 ( 22 ), 8824 -- 8829 ( 2013 ) 10.1073/pnas.1222441110 barticle

    2013 doi

  24. [32]

    , Marchiori , M

    barticle Latora , V. , Marchiori , M. : Is the boston subway a small-world network? Physica A: statistical mechanics and its applications 314 ( 1-4 ), 109 -- 113 ( 2002 ) barticle

    2002

  25. [33]

    , Macdonald , E

    bbook Larice , M. , Macdonald , E. (eds.): The Urban Design Reader , 2 nd edn. Routledge , London ( 2012 ). 10.4324/9780203094235 bbook

    2012 doi

  26. [34]

    , Cardillo , A

    barticle Morer , I. , Cardillo , A. , Díaz-Guilera , A. , Prignano , L. , Lozano , S. : Comparing spatial networks: A one-size-fits-all efficiency-driven approach . Physical Review E 101 ( 4 ), 042301 ( 2020 ) 10.1103/PhysRevE.101.042301 barticle

    2020 doi

  27. [35]

    , Mercadante , G

    barticle Mauttone , A. , Mercadante , G. , Rabaza , M. , Toledo , F. : Bicycle network design: model and solution algorithm . Transportation Research Procedia 27 , 969 -- 976 ( 2017 ) 10.1016/j.trpro.2017.12.119 barticle

    2017 doi

  28. [36]

    , Ferri Ram \' rez , C

    botherref Mart \' nez Plumed , F. , Ferri Ram \' rez , C. , Contreras Ochando , L. : Cycling network projects: A decision-making aid approach (2016) botherref

    2016

  29. [37]

    , Battiston , F

    barticle Natera Orozco , L.G. , Battiston , F. , I \ n iguez , G. , Szell , M. : Data-driven strategies for optimal bicycle network growth . Royal Society Open Science 7 ( 12 ), 201130 ( 2020 ) 10.1098/rsos.201130 barticle

    2020 doi

  30. [38]

    , Duque , J.C

    barticle Ospina , J.P. , Duque , J.C. , Botero-Fernández , V. , Montoya , A. : The maximal covering bicycle network design problem . Transportation Research Part A: Policy and Practice 159 , 222 -- 236 ( 2022 ) 10.1016/j.tra.2022.02.004 barticle

    2022 doi

  31. [39]

    , Bruh \`e ze , A.A

    barticle Oldenziel , R. , Bruh \`e ze , A.A. : Contested spaces: Bicycle lanes in urban europe, 1900-1995 . Transfers 1 ( 2 ), 29 -- 49 ( 2011 ) barticle

    1900

  32. [40]

    , Burgess , E.W

    botherref Park , R.E. , Burgess , E.W. , McKenzie , R.D. : The city chicago. Univ. Press, Chicago (1925) botherref

    1925

  33. [41]

    , Rich , J

    barticle Paulsen , M. , Rich , J. : Societally optimal expansion of bicycle networks . Transportation Research Part B: Methodological 174 , 102778 ( 2023 ) 10.1016/j.trb.2023.06.002 barticle

    2023 doi

  34. [42]

    , Jensen , A.F

    barticle Rich , J. , Jensen , A.F. , Pilegaard , N. , Hallberg , M. : Cost-benefit of bicycle infrastructure with e-bikes and cycle superhighways . Case studies on transport policy 9 ( 2 ), 608 -- 615 ( 2021 ) barticle

    2021

  35. [43]

    , van Oijen , T

    barticle Reggiani , G. , van Oijen , T. , Hamedmoghadam , H. , Daamen , W. , Vu , H.L. , Hoogendoorn , S. : Understanding bikeability: A methodology to assess urban networks . Transportation ( 2021 ) 10.1007/s11116-021-10198-0 barticle

    2021 doi

  36. [44]

    : The centrality index of a graph

    barticle Sabidussi , G. : The centrality index of a graph . Psychometrika 31 ( 4 ), 581 -- 603 ( 1966 ) 10.1007/BF02289527 barticle

    1966 doi

  37. [45]

    https://github.com/csebastiao/orderbike (2024) botherref

    botherref Sebastiao , C. https://github.com/csebastiao/orderbike (2024) botherref

    2024

  38. [46]

    https://github.com/csebastiao/utg (2024) botherref

    botherref Sebastiao , C. https://github.com/csebastiao/utg (2024) botherref

    2024

  39. [47]

    , Levinson , D.M

    barticle Schoner , J.E. , Levinson , D.M. : The missing link: Bicycle infrastructure networks and ridership in 74 US cities . Transportation 41 , 1187 -- 1204 ( 2014 ) barticle

    2014

  40. [48]

    , Mimar , S

    barticle Szell , M. , Mimar , S. , Perlman , T. , Ghoshal , G. , Sinatra , R. : Growing urban bicycle networks . Scientific Reports 12 ( 1 ), 6765 ( 2022 ) 10.1038/s41598-022-10783-y barticle

    2022 doi

  41. [49]

    , Nicosia , V

    barticle Strano , E. , Nicosia , V. , Latora , V. , Porta , S. , Barthélemy , M. : Elementary processes governing the evolution of road networks . Scientific Reports 2 ( 1 ), 296 ( 2012 ) 10.1038/srep00296 barticle

    2012 doi

  42. [50]

    , Paulsen , M

    barticle Steinacker , C. , Paulsen , M. , Schr \"o der , M. , Rich , J. : Robust design of bicycle infrastructure networks . Scientific Reports 15 ( 1 ), 15471 ( 2025 ) barticle

    2025

  43. [51]

    , Storch , D.-M

    barticle Steinacker , C. , Storch , D.-M. , Timme , M. , Schröder , M. : Demand-driven design of bicycle infrastructure networks for improved urban bikeability . Nature Computational Science 2 ( 10 ), 655 -- 664 ( 2022 ) 10.1038/s43588-022-00318-w barticle

    2022 doi

  44. [52]

    , Cunha , T

    barticle Vybornova , A. , Cunha , T. , G \"u hnemann , A. , Szell , M. : Automated detection of missing links in bicycle networks . Geographical Analysis 55 ( 2 ), 239 -- 267 ( 2023 ) 10.1111/gean.12324 barticle

    2023 doi

  45. [53]

    : Human Transit, Revised Edition: How Clearer Thinking About Public Transit Can Enrich Our Communities and Our Lives

    bbook Walker , J. : Human Transit, Revised Edition: How Clearer Thinking About Public Transit Can Enrich Our Communities and Our Lives . Island Press , ??? ( 2024 ) bbook

    2024

  46. [54]

    : Le plan radio-quadrill \'e des terroirs non planifi \'e s

    barticle Watteaux , M. : Le plan radio-quadrill \'e des terroirs non planifi \'e s . \'E tudes rurales 167-168 , 187 -- 214 ( 2003 ) 10.4000/etudesrurales.8024 barticle

    2003 doi

  47. [55]

    , Brown , J.H

    barticle West , G.B. , Brown , J.H. : The origin of allometric scaling laws in biology from genomes to ecosystems: towards a quantitative unifying theory of biological structure and organization . Journal of experimental biology 208 ( 9 ), 1575 -- 1592 ( 2005 ) barticle

    2005

  48. [56]

    , Mo , H

    barticle Wang , J. , Mo , H. , Wang , F. : Evolution of air transport network of China 1930--2012 . Journal of Transport Geography 40 , 145 -- 158 ( 2014 ) 10.1016/j.jtrangeo.2014.02.002 barticle

    1930 doi

  49. [57]

    , N \"o bel , C

    barticle Wiedemann , N. , N \"o bel , C. , Ballo , L. , Martin , H. , Raubal , M. : Bike network planning in limited urban space . Transportation Research Part B: Methodological 192 , 103135 ( 2025 ) 10.1016/j.trb.2024.103135 barticle

    2025

  50. [58]

    , Levinson , D

    barticle Xie , F. , Levinson , D. : Modeling the Growth of Transportation Networks : A Comprehensive Review . Networks and Spatial Economics 9 ( 3 ), 291 -- 307 ( 2009 ) 10.1007/s11067-007-9037-4 barticle

    2009 doi

  51. [59]

    , Ke , J

    barticle Yang , H. , Ke , J. , Ye , J. : A universal distribution law of network detour ratios . Transportation Research Part C: Emerging Technologies 96 , 22 -- 37 ( 2018 ) 10.1016/j.trc.2018.09.012 barticle

    2018 doi

  52. [60]

    write newline

    " write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTI...

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.