Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs

被引：0
|
作者：
AT and T Labs. Research, 180 Park Ave., Florham Park, NJ 07932, United States [1 ]
不详 [2 ]
不详 [3 ]
不详 [4 ]
机构：
来源：
SIAM J Comput | / 5卷 / 1906-1922期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] A characterization of strongly chordal graphs
    Dahlhaus, E
    Manuel, PD
    Miller, M
    DISCRETE MATHEMATICS, 1998, 187 (1-3) : 269 - 271
  • [22] Linear time algorithms on chordal bipartite and strongly chordal graphs
    Uehara, R
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 993 - 1004
  • [23] Dual-chordal and strongly dual-chordal graphs
    McKee, Terry A.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 93 : 53 - 63
  • [24] Listing chordal graphs and interval graphs
    Kiyomi, Masashi
    Kijima, Shuji
    Uno, Takeaki
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 68 - 77
  • [25] Chordal graphs, interval graphs, and wqo
    Ding, GL
    JOURNAL OF GRAPH THEORY, 1998, 28 (02) : 105 - 114
  • [26] Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
    Chunmei Liu
    Yinglei Song
    Journal of Combinatorial Optimization, 2011, 22 : 684 - 698
  • [27] Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
    Liu, Chunmei
    Song, Yinglei
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (04) : 684 - 698
  • [28] On the proper orientation number of chordal graphs
    Araujo, J.
    Cezar, A.
    Lima, C. V. G. C.
    dos Santos, V. F.
    Silva, A.
    THEORETICAL COMPUTER SCIENCE, 2021, 888 : 117 - 132
  • [29] Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
    Dahlhaus, E
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 487 - 498
  • [30] Chordal bipartite completion of colored graphs
    Sritharan, R.
    DISCRETE MATHEMATICS, 2008, 308 (12) : 2581 - 2588
12345