期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2018
卷号：6
期号：6
页码：6227-6234
DOI：10.15680/IJIRCCE.2018.0606006
出版社：S&S Publications
摘要：Interval graphs are rich in combinatorial structures and have found applications in several disciplines
such as traffic control, Ecology, Biology, Computer Science etc. .Circular-arc graphs are introduced as generalization
of Interval graphs. If we bend the real line into a circle, then any family of intervals of the real line is transformed into a
family of arcs of the circle. In this paper we are presenting an algorithm for finding an efficient dominating set of an
interval family if it exists and Also an algorithm for finding a non- split dominating set of circular-arc graph.
