Container problem in burnt pancake graphs

被引：0
|
作者：
Sawada, N [1 ]
Suzuki, Y [1 ]
Kaneko, K [1 ]
机构：
[1] Tokyo Univ Agr & Technol, Tokyo 1848588, Japan
来源：
PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS | 2005年 / 3758卷
关键词：
burnt pancake graphs; container problem; internally disjoint paths; polynomial time algorithm;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we propose an algorithm that solves the container problem in n-burnt pancake graphs in polynomial order time of n. Its correctness is proved and estimates of time complexity and sum of paths lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm.
引用
收藏
页码：479 / 490
页数：12
相关论文
共 50 条
  • [1] Neighbor connectivity of pancake graphs and burnt pancake graphs
    Gu, Mei-Mei
    Chang, Jou-Ming
    DISCRETE APPLIED MATHEMATICS, 2023, 324 : 46 - 57
  • [2] Star structure connectivities of pancake graphs and burnt pancake graphs
    Dilixiati, Subinur
    Sabir, Eminjan
    Meng, Jixiang
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2021, 36 (05) : 440 - 448
  • [3] The Spanning Connectivity of the Burnt Pancake Graphs
    Chin, Cherng
    Weng, Tien-Hsiung
    Hsu, Lih-Hsing
    Chiou, Shang-Chia
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2009, E92D (03) : 389 - 400
  • [4] PAPER Feedback Node Sets in Pancake Graphs and Burnt Pancake
    Jung, Sinyu
    Kaneko, Keiichi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2023, E106D (10) : 1677 - 1685
  • [5] An algorithm for node-to-set disjoint paths problem in burnt pancake graphs
    Kaneko, K
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2003, E86D (12): : 2588 - 2594
  • [6] An algorithm for node-to-node disjoint paths problem in burnt pancake graphs
    Kaneko, Keiichi
    Sawada, Naoki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007, E90D (01) : 306 - 313
  • [7] Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs
    Gupta, Sambhav
    Cheng, Eddie
    Liptak, Laszlo
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2022, 7 (04) : 207 - 222
  • [8] Fractional matching preclusion for (burnt) pancake graphs
    Ma, Tianlong
    Mao, Yaping
    Cheng, Eddie
    Melekian, Christopher
    2018 15TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS AND NETWORKS (I-SPAN 2018), 2018, : 125 - 133
  • [9] Strong matching preclusion of burnt pancake graphs
    Cheng, Eddie
    Kelm, Justin T.
    Orzach, Roi
    Xu, Brian
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2016, 31 (03) : 220 - 232
  • [10] Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs
    Cheng, Eddie
    Hu, Philip
    Jia, Roger
    Liptak, Laszlo
    Scholten, Brian
    Voss, James
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2014, 29 (05) : 499 - 512
12345