A rough-set based solution of the total domination problem
From MaRDI portal
Recommendations
- A heuristic approximation algorithm of minimum dominating set based on rough set theory
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Equivalent characterizations of some graph problems by covering-based rough sets
- Finding a minimum dominating set by transforming domination of vertices
- An application of rough sets to graph theory
Cites work
- A survey of selected recent results on total domination in graphs
- Association Reducts: Complexity and Heuristics
- Discernibility matrix simplification for constructing attribute reducts
- Experimental analysis of Heuristic algorithms for the dominating set problem
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 108581 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On generalized decision functions: reducts, networks and ensembles
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Two Bayesian approaches to rough sets
Cited in
(2)
This page was built for publication: A rough-set based solution of the total domination problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082211)