The Problem of Solving the Independent-Dominating Set of a Graph is Open
  
Key Words: graph theory   independent set   dominating set   algorithm  
Fund Project:
Author NameAffiliation
Mo Zhongxi Mathematical College of Wuhan University
Wuhan 430072 
Hits: 2375
Download times: 949
Abstract:
      This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [1] are wrong.
Citation:
DOI:10.3770/j.issn:1000-341X.1999.01.025
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.