Wiring edge-disjoint layouts

被引：0
作者：
Fak. für Math. und Informatik, Universität Konstanz, D-78457 Konstanz, Germany [1 ]
机构：
来源：
Comput Geom Theory Appl | / 4卷 / 255-273期
关键词：
Number:; Wa; 654/10-2; Acronym:; DFG; Sponsor: Deutsche Forschungsgemeinschaft;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 8 条
  • [1] Parallel algorithm for shortest pairs of edge-disjoint paths
    Banerjee, S
    Ghosh, RK
    Reddy, APK
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 33 (02) : 165 - 171
  • [2] EDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE
    Yuster, Raphael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (02) : 893 - 910
  • [3] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
    Iwata, Satoru
    Yokoi, Yu
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1933 - 1944
  • [4] FINDING MAXIMUM EDGE-DISJOINT PATHS BETWEEN MULTIPLE TERMINALS
    Iwata, Satoru
    Yokoi, Yu
    SIAM JOURNAL ON COMPUTING, 2023, 52 (05) : 1230 - 1268
  • [5] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
    Iwata, Satoru
    Yokoi, Yu
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1933 - 1944
  • [6] Spectral radius, edge-disjoint cycles and cycles of the same length
    Lin, Huiqiu
    Zhai, Mingqing
    Zhao, Yanhua
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (02)
  • [7] On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
    Yang, Yu
    Liu, Hongbo
    Wang, Hua
    Feng, Shigang
    DISCRETE APPLIED MATHEMATICS, 2016, 203 : 184 - 203
  • [8] Nowhere-zero 3-flow and Z3-connectedness in graphs with four edge-disjoint spanning trees
    Han, Miaomiao
    Lai, Hong-Jian
    Li, Jiaao
    JOURNAL OF GRAPH THEORY, 2018, 88 (04) : 577 - 591
1