The path partition problem and related problems in bipartite graphs

被引：47
|
作者：
Monnot, Jerome
Toulouse, Sophie
机构：
[1] Univ Paris 09, LAMSADE, CNRS, UMR 7024, F-75775 Paris 16, France
[2] Univ Paris 13, Inst Galilee, LIPN, CNRS,UMR 7030, F-93430 Villetaneuse, France
来源：
OPERATIONS RESEARCH LETTERS | 2007年 / 35卷 / 05期
关键词：
P-k-partition; path packing; path partition; bipartite graphs; APX-hardness; approximation algorithms; APPROXIMATION ALGORITHM;
D O I：
10.1016/j.orl.2006.12.004
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some approximation and inapproximation results for several related problems. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：677 / 684
页数：8
相关论文
共 50 条
  • [31] On the Ramsey problem for multicolor bipartite graphs
    Carnielli, WA
    Carmelo, ELM
    ADVANCES IN APPLIED MATHEMATICS, 1999, 22 (01) : 48 - 59
  • [32] An extremal bandwidth problem for bipartite graphs
    Brigham, RC
    Carrington, JR
    Dutton, RD
    Fiedler, J
    Vitray, RP
    JOURNAL OF GRAPH THEORY, 2000, 35 (04) : 278 - 289
  • [33] SOME MATCHING PROBLEMS FOR BIPARTITE GRAPHS
    ITAI, A
    RODEH, M
    TANIMOTO, SL
    JOURNAL OF THE ACM, 1978, 25 (04) : 517 - 525
  • [34] INFINITE TURAN PROBLEMS FOR BIPARTITE GRAPHS
    Peng, Xing
    Timmons, Craig
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (02) : 702 - 710
  • [35] The multiplication table problem for bipartite graphs
    Narayanan, Bhargav P.
    Sahasrabudhe, Julian
    Tomon, Istvan
    COMBINATORICA, 2017, 37 (05) : 991 - 1010
  • [36] An ordered Turan problem for bipartite graphs
    Timmons, Craig
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (04):
  • [37] The multiplication table problem for bipartite graphs
    Bhargav P. Narayanan
    Julian Sahasrabudhe
    István Tomon
    Combinatorica, 2017, 37 : 991 - 1010
  • [38] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHINGS IN CONVEX BIPARTITE GRAPHS AND RELATED PROBLEMS
    LIPSKI, W
    PREPARATA, FP
    ACTA INFORMATICA, 1981, 15 (04) : 329 - 346
  • [39] Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems
    Boros, E
    Elbassioni, K
    Gurvich, V
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 122 - 133
  • [40] ON THE ISOMETRIC PATH PARTITION PROBLEM
    Manuel, Paul
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (04) : 1077 - 1089
12345