One China, many paths

被引:0
|
作者
Benton, G [1 ]
机构
[1] Cardiff Univ, Cardiff, Wales
来源
ECONOMIC HISTORY REVIEW | 2005年 / 58卷 / 04期
关键词
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
引用
收藏
页码:870 / 872
页数:3
相关论文
共 50 条
  • [31] 'IN A PLACE OF MANY PATHS'
    INVERARITY, G
    [J]. ANTIGONISH REVIEW, 1991, (84): : 53 - 53
  • [32] Optimal virtual topologies for one-to-many communication in WDM paths and rings
    Hartline, JRK
    Libeskind-Hadas, R
    Dresner, KM
    Drucker, EW
    Ray, KJ
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (02) : 375 - 383
  • [33] An efficient construction of one-to-many node-disjoint paths in folded hypercubes
    Lai, Cheng-Nan
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (04) : 2310 - 2316
  • [34] One-to-many node-disjoint paths of hyper-star networks
    Liptak, Laszlo
    Cheng, Eddie
    Kim, Jong-Seok
    Kim, Sung Won
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (13-14) : 2006 - 2014
  • [35] One-to-Many Node-Disjoint Paths Routing in Dense Gaussian Networks
    Alsaleh, Omar
    Bose, Bella
    Hamdaoui, Bechir
    [J]. COMPUTER JOURNAL, 2015, 58 (02): : 173 - 187
  • [36] Many paths, one destination: mapping the movements of a kleptoparasitic spider on the host's web
    Rosales-Garcia, Rogelio
    Tapia-McClung, Horacio
    Narendra, Ajay
    Rao, Dinesh
    [J]. JOURNAL OF COMPARATIVE PHYSIOLOGY A-NEUROETHOLOGY SENSORY NEURAL AND BEHAVIORAL PHYSIOLOGY, 2021, 207 (02): : 293 - 301
  • [37] One-to-many node-disjoint paths in (n, k)-star graphs
    Xiang, Yonghong
    Stewart, Iain A.
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (01) : 62 - 70
  • [38] MANY PATHS, ONE GOAL - 3 ACCOUNTS OF THE 1893 WORLD-PARLIAMENT-OF-RELIGIONS
    VIVEKANANDA
    ISHERWOOD, C
    ROLLAND, R
    [J]. PARABOLA, 1993, 18 (03): : 20 - 25
  • [39] Many paths, one destination: mapping the movements of a kleptoparasitic spider on the host’s web
    Rogelio Rosales-García
    Horacio Tapia-McClung
    Ajay Narendra
    Dinesh Rao
    [J]. Journal of Comparative Physiology A, 2021, 207 : 293 - 301
  • [40] Paths with many shortcuts in tournaments
    Yuster, Raphael
    [J]. DISCRETE MATHEMATICS, 2021, 344 (01)