A polynomial time algorithm for the triangle packing problem on interval graphs

被引：0
|
作者：
Myung, Young-Soo [1 ]
机构：
[1] Dankook Univ, Dept Business Adm, Yongin 16890, Gyeonggi, South Korea
来源：
DISCRETE APPLIED MATHEMATICS | 2024年 / 343卷
关键词：
Packing triangles; Polynomial time algorithm; Interval graph;
D O I：
10.1016/j.dam.2023.10.022
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The triangle packing problem (TPP) is to find the maximum number of pairwise vertex disjoint triangles in a given graph. The TPP is NP-complete in a general graph and even so when a given graph is restricted to a chordal graph. On the other hand, the TPP can be solved in polynomial time for unit interval graphs. For this reason, it is a well-known open problem to prove whether there exists a polynomial time algorithm solving the TPP on interval graphs. In this paper, we give an answer to the problem.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页码：180 / 183
页数：4
相关论文
共 50 条
  • [1] A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
    Boyaci, Arman
    Ekim, Tinaz
    Shalom, Mordechai
    [J]. INFORMATION PROCESSING LETTERS, 2017, 121 : 29 - 33
  • [2] A polynomial time recognition algorithm for probe interval graphs
    Johnson, JL
    Spinrad, JP
    [J]. PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 477 - 486
  • [3] Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
    Peng Li
    Aifa Wang
    [J]. Journal of Combinatorial Optimization, 2023, 45
  • [4] Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
    Li, Peng
    Wang, Aifa
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
  • [5] A Heuristic Algorithm for Solving Triangle Packing Problem
    Wang, Ruimin
    Luo, Yuqiang
    Dong, Jianqiang
    Liu, Shuai
    Qi, Xiaozhuo
    [J]. DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2013, 2013
  • [6] Capturing Polynomial Time on Interval Graphs
    Laubner, Bastian
    [J]. 25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010), 2010, : 199 - 208
  • [7] The Longest Path Problem Is Polynomial on Interval Graphs
    Ioannidou, Kyriaki
    Mertzios, George B.
    Nikolopoulos, Stavros D.
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 403 - +
  • [8] The weighted integrity problem is polynomial for interval graphs
    Ray, S
    Kannan, R
    Zhang, DY
    Jiang, H
    [J]. ARS COMBINATORIA, 2006, 79 : 77 - 95
  • [9] The longest cycle problem is polynomial on interval graphs
    Shang, Jianhui
    Li, Peng
    Shi, Yi
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 859 : 37 - 47
  • [10] A Polynomial Algorithm for Weighted Toughness of Interval Graphs
    Shi, Ming
    Wei, Zongtian
    [J]. JOURNAL OF MATHEMATICS, 2021, 2021
12345