A Rough-Set Based Solution of the Total Domination Problem

DOI10.1007/978-3-319-60837-2_11zbMath1489.68305OpenAlexW2690391823MaRDI QIDQ5082211

Chao Wang, Yuzhi Tao, Anhui Tan

Publication date: 15 June 2022

Published in: Rough Sets (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-60837-2_11

zbMATH Keywords

graphrough settotal dominating setattribute reductioninformation table

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

A heuristic approximation algorithm of minimum dominating set based on rough set theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two Bayesian approaches to rough sets
• Positive approximation: an accelerator for attribute reduction in rough set theory
• A survey of selected recent results on total domination in graphs
• Discernibility matrix simplification for constructing attribute reducts
• Experimental analysis of Heuristic algorithms for the dominating set problem
• On Generalized Decision Functions: Reducts, Networks and Ensembles
• Association Reducts: Complexity and Heuristics

This page was built for publication: A Rough-Set Based Solution of the Total Domination Problem