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 条
  • [21] A Tight Lower Bound for Entropy Flattening
    Chen, Yi-Hsiu
    Goos, Mika
    Vadhan, Salil P.
    Zhang, Jiapeng
    [J]. 33RD COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2018), 2018, 102
  • [22] A tight lower bound on the minimal dispersion
    Trodler, M.
    Volec, J.
    Vybiral, J.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2024, 120
  • [23] A Tight Lower Bound for Steiner Orientation
    Chitnis, Rajesh
    Feldmann, Andreas Emil
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018, 2018, 10846 : 65 - 77
  • [24] QUANTUM LOWER BOUND FOR INVERTING A PERMUTATION WITH ADVICE
    Nayebi, Aran
    Aaronson, Scott
    Belovs, Aleksandrs
    Trevisan, Luca
    [J]. QUANTUM INFORMATION & COMPUTATION, 2015, 15 (11-12) : 901 - 913
  • [25] Kernelization lower bound for Permutation Pattern Matching
    Bliznets, Ivan
    Cygan, Marek
    Komosa, Pawel
    Mach, Lukas
    [J]. INFORMATION PROCESSING LETTERS, 2015, 115 (05) : 527 - 531
  • [26] A tight lower bound for restricted pir protocols
    Beigel, R
    Fortnow, L
    Gasarch, W
    [J]. COMPUTATIONAL COMPLEXITY, 2006, 15 (01) : 82 - 91
  • [27] Tight Lower Bound for the Channel Assignment Problem
    Socala, Arkadiusz
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (04)
  • [28] A tight lower bound for the best-α algorithm
    Torng, E
    Uthaisombut, P
    [J]. INFORMATION PROCESSING LETTERS, 1999, 71 (01) : 17 - 22
  • [29] Tight Lower Bound for Linear Sketches of Moments
    Andoni, Alexandr
    Nguyen, Huy L.
    Polyanskiy, Yury
    Wu, Yihong
    [J]. AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 25 - 32
  • [30] A TIGHT LOWER BOUND FOR THE TRAIN REVERSAL PROBLEM
    AGGARWAL, A
    LEIGHTON, T
    [J]. INFORMATION PROCESSING LETTERS, 1990, 35 (06) : 301 - 304
12345