A TIGHT LOWER BOUND ON THE SIZE OF PLANAR PERMUTATION NETWORKS

被引：3
|
作者：
KLAWE, M [1 ]
LEIGHTON, T [1 ]
机构：
[1] MIT,DEPT MATH,CAMBRIDGE,MA 02139
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1992年 / 5卷 / 04期
关键词：
PLANAR GRAPHS; PERMUTATION LAYOUTS; SWITCHING; CIRCUITS;
D O I：
10.1137/0405045
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A tight lower bound is proved on the minimum number of vertices in a planar graph in which any permutation between t distinguished vertices can be realized by vertex disjoint paths.
引用
收藏
页码：558 / 563
页数：6
相关论文
共 50 条
  • [31] A tight lower bound for optimal bin packing
    Chao, HY
    Harper, MP
    Quong, RW
    [J]. OPERATIONS RESEARCH LETTERS, 1995, 18 (03) : 133 - 138
  • [32] A tight lower bound for job scheduling with cancellation
    Zheng, FF
    Chin, FYL
    Fung, SPY
    Poon, CK
    Xu, YF
    [J]. INFORMATION PROCESSING LETTERS, 2006, 97 (01) : 1 - 3
  • [33] A tight lower bound for restricted pir protocols
    Richard Beigel
    Lance Fortnow
    William Gasarch
    [J]. computational complexity, 2006, 15 : 82 - 91
  • [34] Betweenness parameterized above tight lower bound
    Gutin, Gregory
    Kim, Eun Jung
    Mnich, Matthias
    Yeo, Anders
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (08) : 872 - 878
  • [35] Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks
    Wang, Xinbing
    Yu, Tuo
    Xu, Yuanzhong
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (04) : 754 - 766
  • [36] A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
    van Zuylen, Anke
    Bieron, James
    Schalekamp, Frans
    Yu, Gexin
    [J]. INFORMATION PROCESSING LETTERS, 2016, 116 (11) : 718 - 722
  • [37] Improved Attacks on sLiSCP Permutation and Tight Bound of Limited Birthday Distinguishers
    Hosoyamada, Akinori
    Naya-Plasencia, Maria
    Sasaki, Yu
    [J]. IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2020, 2020 (04) : 147 - 172
  • [38] SINR Tight Lower bound for Asynchronous OFDM-based Multiple-Access Networks
    Medjandi, Yahia
    Amara, Mustapha
    Louveaux, Jerome
    [J]. 2014 11TH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATIONS SYSTEMS (ISWCS), 2014, : 761 - 765
  • [39] Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks
    Xu, Yuanzhong
    Wang, Xinbing
    [J]. 2011 PROCEEDINGS IEEE INFOCOM, 2011, : 972 - 980
  • [40] A tight lower bound for the completion time variance problem
    Ng, CT
    Cai, X
    Cheng, TCE
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 92 (01) : 211 - 213
12345