Skip to main content
SpringerLink
Log in
Book cover

International Joint Conference on Rough Sets

IJCRS 2017: Rough Sets pp 131–139Cite as

A Rough-Set Based Solution of the Total Domination Problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10313))

Abstract

This paper aims to provide a rough set-based reduction solution for a type of domination problem in graph theory. First, we introduce a decision table to represent the vertices and edges of a graph. Second, we claim that computing a minimal total dominating set of a graph is equivalent to finding a reduct of the induced decision table. Then, a reduction algorithm in rough set theory is designed for finding a suboptimal total dominating set of a graph. In the end, numerical experiments are conducted to examine the effectiveness and efficiency of the proposed algorithm.

This is a preview of subscription content, log in via an institution.

References

  1. Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)

    MATH  Google Scholar 

  2. Henning, M.: A survey of selected recent results on total domination in graphs. Discret. Math. 309, 32–63 (2009)

    Article  MathSciNet  Google Scholar 

  3. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishing, Dordrecht (1991)

    Book  Google Scholar 

  4. Qian, Y., Liang, J., Pedrycz, J., Dang, C.: Positive approximation: an accelerator for attribute reduction in rough set theory. Artif. Intell. 174, 597–618 (2010)

    Article  MathSciNet  Google Scholar 

  5. Sanchis, L.: Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33, 3–18 (2002)

    Article  MathSciNet  Google Scholar 

  6. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems, handbook of applications and advances of the rough sets theory. In: Slowinski, R. (ed.) Intelligent Decision Support. Kluwer, Dordrecht (1992)

    Google Scholar 

  7. Ślęzak, D.: Association reducts: complexity and heuristics. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 157–164. Springer, Heidelberg (2006). doi:10.1007/11908029_18

    Chapter  MATH  Google Scholar 

  8. Ślęzak, D.: On generalized decision functions: reducts, networks and ensembles. In: Yao, Y., Hu, Q., Yu, H., Grzymala-Busse, J.W. (eds.) RSFDGrC 2015. LNCS (LNAI), vol. 9437, pp. 13–23. Springer, Cham (2015). doi:10.1007/978-3-319-25783-9_2

    Chapter  Google Scholar 

  9. Wang, G., Yu, H., Yang, D.: Decision table reduction based on conditional information entropy. Chin. J. Comput. 25, 759–766 (2002)

    MathSciNet  Google Scholar 

  10. Yao, Y., Zhao, Y.: Discernibility matrix simplification for constructing attribute reducts. Inf. Sci. 179, 867–882 (2009)

    Article  MathSciNet  Google Scholar 

  11. Yao, Y., Zhao, Y.: Two bayesian approaches to rough sets. Eur. J. Oper. Res. 251, 904–917 (2016)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by a grant from the National Natural Science Foundation of China (No. 61602415).

Author information

Authors and Affiliations

  1. School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan, 316022, Zhejiang, People’s Republic of China

    Anhui Tan, Yuzhi Tao & Chao Wang

  2. Key Laboratory of Oceanographic Big Data Mining and Application of Zhejiang Province, Zhoushan, 316022, Zhejiang, People’s Republic of China

    Anhui Tan, Yuzhi Tao & Chao Wang

Authors
  1. Anhui Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuzhi Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anhui Tan .

Editor information

Editors and Affiliations

  1. Polish-Japanese Academy of Information Technology, Warsaw, Poland

    Lech Polkowski

  2. University of Regina, Regina, SK, Canada

    Yiyu Yao

  3. University of Warmia and Mazury, Olsztyn, Poland

    Piotr Artiemjew

  4. University of Milano-Bicocca, Milano, Italy

    Davide Ciucci

  5. Southwest Jiaotong University, Chengdu, China

    Dun Liu

  6. Warsaw University, Warszawa, Poland

    Dominik Ślęzak

  7. Silesian University, Sosnowiec, Poland

    Beata Zielosko

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Tan, A., Tao, Y., Wang, C. (2017). A Rough-Set Based Solution of the Total Domination Problem. In: Polkowski, L., et al. Rough Sets. IJCRS 2017. Lecture Notes in Computer Science(), vol 10313. Springer, Cham. https://doi.org/10.1007/978-3-319-60837-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60837-2_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60836-5

  • Online ISBN: 978-3-319-60837-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation