• DocumentCode
    1982492
  • Title

    Solving Minimum Connected Dominating Set on Proper Interval Graph

  • Author

    Jinqin Tian ; Hongsheng Ding

  • Author_Institution
    Beifang Univ. of Nat. Yinchuan, Yinchuan, China
  • Volume
    1
  • fYear
    2013
  • fDate
    28-29 Oct. 2013
  • Firstpage
    73
  • Lastpage
    76
  • Abstract
    To solve connected dominating problem, it is necessary to find minimum connected dominating set (MCDS for short). However, to find MCDS is NP-hardness. So, a model of graphs called interval graph was constructed from nodes of related network. Two greedy algorithms with linear (or polynomial time) were used to find MCDS on proper interval graph (or interval graph), and have 1 approximation ratio on the graphs. And spanning trees were constructed and used to validate the correctness and effectiveness of corresponding algorithms.
  • Keywords
    computational complexity; greedy algorithms; trees (mathematics); MCDS; NP-hard problem; greedy algorithms; minimum connected dominating set; polynomial time; proper interval graph; spanning trees; Ad hoc networks; Approximation algorithms; Approximation methods; Arrays; Greedy algorithms; Polynomials; Time complexity; CDS; MCDS; greedy algorithm; interval graphs; spanning tree;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Design (ISCID), 2013 Sixth International Symposium on
  • Conference_Location
    Hangzhou
  • Type

    conf

  • DOI
    10.1109/ISCID.2013.25
  • Filename
    6804789
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1982492