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 条
  • [1] A TIGHT LOWER BOUND ON THE SIZE OF PLANAR PERMUTATION NETWORKS
    KLAWE, M
    LEIGHTON, T
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 281 - 287
  • [2] A Tight Lower Bound for Planar Steiner Orientation
    Chitnis, Rajesh
    Feldmann, Andreas Emil
    Suchy, Ondrej
    [J]. ALGORITHMICA, 2019, 81 (08) : 3200 - 3216
  • [3] A Tight Lower Bound for Planar Steiner Orientation
    Rajesh Chitnis
    Andreas Emil Feldmann
    Ondřej Suchý
    [J]. Algorithmica, 2019, 81 : 3200 - 3216
  • [4] A TIGHT LOWER BOUND ON THE SIZE OF VISIBILITY GRAPHS
    SHEN, X
    EDELSBRUNNER, H
    [J]. INFORMATION PROCESSING LETTERS, 1987, 26 (02) : 61 - 64
  • [5] A computational study of the permutation flow shop problem based on a tight lower bound
    Ladhari, T
    Haouari, M
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (07) : 1831 - 1847
  • [6] A Tight Lower Bound for Parity in Noisy Communication Networks
    Dutta, Chinmoy
    Kanoria, Yashodhan
    Manjunath, D.
    Radhakrishnan, Jaikumar
    [J]. PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 1056 - +
  • [7] A Tight Lower Bound on the Controllability of Networks with Multiple Leaders
    Yazicioglu, A. Yasin
    Abbas, Waseem
    Egerstedt, Magnus
    [J]. 2012 IEEE 51ST ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2012, : 1978 - 1983
  • [8] Distinguishing views in symmetric networks: A tight lower bound
    Dereniowski, Dariusz
    Kosowski, Adrian
    Pajak, Dominik
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 582 : 27 - 34
  • [9] A LOWER-BOUND FOR SORTING NETWORKS BASED ON THE SHUFFLE PERMUTATION
    PLAXTON, CG
    SUEL, T
    [J]. MATHEMATICAL SYSTEMS THEORY, 1994, 27 (05): : 491 - 508
  • [10] A TIGHT LOWER BOUND FOR EDGE-DISJOINT PATHS ON PLANAR DAGS*
    Chitnis, Rajesh
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 556 - 572
12345