A Theoretical Investigation Based on the Rough Approximations of Hypergraphs
Rough sets are a key tool to model uncertainty and vagueness using upper and lower approximations without predefined functions and additional suppositions. Rough graphs cannot be studied more effectively when the inexact and approximate relations among more than two objects are to be discussed. In t...
Saved in:
Main Author: | Musavarah Sarwar |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2022-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2022/1540004 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
New Rough Approximations Based on E-Neighborhoods
by: Tareq M. Al-shami, et al.
Published: (2021-01-01) -
Encapsulation structure and dynamics in hypergraphs
by: Timothy LaRock, et al.
Published: (2023-01-01) -
On Clustering Detection Based on a Quadratic Program in Hypergraphs
by: Qingsong Tang
Published: (2022-01-01) -
Comparison of modularity-based approaches for nodes clustering in hypergraphs
by: Poda, Veronica, et al.
Published: (2024-03-01) -
Texts as Hypergraphs: An Intuitive Representation of Interpretations of Text
by: Elli Bleeker, et al.
Published: (2022-06-01)