Star Partitions of Perfect Graphs

被引：0
|
作者：
van Bevern, Rene [1 ]
Bredereck, Robert [1 ]
Bulteau, Laurent [1 ]
Chen, Jiehua [1 ]
Froese, Vincent [1 ]
Niedermeier, Rolf [1 ]
Woeginger, Gerhard J. [2 ]
机构：
[1] TU Berlin, Inst Softwaretech & Theoret Informat, Berlin, Germany
[2] TU Eindhoven, Dept Math & Comp Sci, Eindhoven, Netherlands
来源：
AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I | 2014年 / 8572卷
关键词：
BIPARTITE GRAPHS; CHORDAL GRAPHS; PATH PARTITION; COMPLEXITY;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The partition of graphs into nice subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-hard cases, for example, on grid graphs and chordal graphs.
引用
收藏
页码：174 / 185
页数：12
相关论文
共 50 条
  • [31] On judicious partitions of graphs
    Muhuo Liu
    Baogang Xu
    [J]. Journal of Combinatorial Optimization, 2016, 31 : 1383 - 1398
  • [32] Generalized partitions of graphs
    MacGillivray, G
    Yu, ML
    [J]. DISCRETE APPLIED MATHEMATICS, 1999, 91 (1-3) : 143 - 153
  • [33] Counting Partitions of Graphs
    Hell, Pavol
    Hermann, Miki
    Nevisi, Mayssam Mohammadi
    [J]. ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 227 - 236
  • [34] Complete partitions of graphs
    Halldorsson, Magnus M.
    Kortsarz, Guy
    Radhakrishnan, Jaikumar
    Sivasubramanian, Sivaramakrishnan
    [J]. COMBINATORICA, 2007, 27 (05) : 519 - 550
  • [35] PARTITIONS IN MATRICES AND GRAPHS
    HUGHES, DR
    SINGHI, NM
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1991, 12 (03) : 223 - 235
  • [36] Complete Partitions of Graphs
    Kortsarz, Guy
    Radhakrishnan, Jaikumar
    Sivasubramanian, Sivaramakrishnan
    [J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 860 - 869
  • [37] A generalization of perfect graphs - i-perfect graphs
    Cai, LZ
    Corneil, D
    [J]. JOURNAL OF GRAPH THEORY, 1996, 23 (01) : 87 - 103
  • [38] SOME RESULTS ON CIRCULAR PERFECT GRAPHS AND PERFECT GRAPHS
    XU Baogang (School of Mathematics and Computer Science
    [J]. Journal of Systems Science & Complexity, 2005, (02) : 167 - 173
  • [39] On ωψ-Perfect Graphs
    Araujo-Pardo, G.
    Rubio-Montiel, C.
    [J]. ARS COMBINATORIA, 2018, 141 : 375 - 387
  • [40] Biased Partitions and Judicious k-Partitions of Graphs
    Qing Hou ZENG
    Jian Feng HOU
    Jin DENG
    Xia LEI
    [J]. Acta Mathematica Sinica., 2017, 33 (05) - 680
12345