Computing Minimum Geodetic Sets of Proper Interval Graphs

被引：0
|
作者：
Ekim, Tinaz [1 ]
Erey, Aysel [1 ]
Heggernes, Pinar [2 ]
van 't Hof, Pim [2 ]
Meister, Daniel [3 ]
机构：
[1] Bogazici Univ, Istanbul, Turkey
[2] Univ Bergen, Bergen, Norway
[3] Univ Trier, Trier, Germany
来源：
LATIN 2012: THEORETICAL INFORMATICS | 2012年 / 7256卷
关键词：
NUMBERS;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show that the geodetic number of proper interval graphs can be computed in polynomial time. This problem is NP-hard on chordal graphs and on bipartite weakly chordal graphs. Only an upper bound on the geodetic number of proper interval graphs has been known prior to our result.
引用
收藏
页码：279 / 290
页数：12
相关论文
共 50 条
  • [1] MINIMUM PROPER INTERVAL-GRAPHS
    GUTIERREZ, M
    OUBINA, L
    [J]. DISCRETE MATHEMATICS, 1995, 142 (1-3) : 77 - 85
  • [2] Minimum Maximal Acyclic Matching in Proper Interval Graphs
    Chaudhary, Juhi
    Mishra, Sounaka
    Panda, B. S.
    [J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2023, 2023, 13947 : 377 - 388
  • [3] On minimum intersection of two minimum dominating sets of interval graphs
    Chang, MS
    Hsu, CC
    [J]. DISCRETE APPLIED MATHEMATICS, 1997, 78 (1-3) : 41 - 50
  • [4] Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
    Mezzini, Mauro
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 745 : 63 - 74
  • [5] Geodetic sets and Steiner sets in graphs
    Tong, Li-Da
    [J]. DISCRETE MATHEMATICS, 2009, 309 (12) : 4205 - 4207
  • [6] Computing Role Assignments of Proper Interval Graphs in Polynomial Time
    Heggernes, Pinar
    van't Hof, Pim
    Paulusma, Daniel
    [J]. COMBINATORIAL ALGORITHMS, 2011, 6460 : 167 - +
  • [7] Computing role assignments of proper interval graphs in polynomial time
    Heggernes, Pinar
    Van't Hof, Pim
    Paulusma, Daniel
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2012, 14 : 173 - 188
  • [8] On geodetic and k-geodetic sets in graphs
    Bermudo, Sergio
    Rodriguez-Velazquez, Juan A.
    Sigarreta, Jose M.
    Yero, Ismael G.
    [J]. ARS COMBINATORIA, 2010, 96 : 469 - 478
  • [9] Separator Theorems for Interval Graphs and Proper Interval Graphs
    Panda, B. S.
    [J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS (CALDAM 2015), 2015, 8959 : 101 - 110
  • [10] Closed graphs are proper interval graphs
    Crupi, Marilena
    Rinaldo, Giancarlo
    [J]. ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2014, 22 (03): : 37 - 44
12345