Cargando…
Rough approximation models via graphs based on neighborhood systems
Neighborhood systems are used to approximate graphs as finite topological structures. Throughout this article, we construct new types of eight neighborhoods for vertices of an arbitrary graph, say, j-adhesion neighborhoods. Both notions of Allam et al. and Yao will be extended via j-adhesion neighbo...
Autores principales: | El Atik, Abd El Fattah, Nawar, Ashraf, Atef, Mohammed |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7643720/ http://dx.doi.org/10.1007/s41066-020-00245-z |
Ejemplares similares
-
Improved rough approximations based on variable J-containment neighborhoods
por: Zheng, Tingting
Publicado: (2023) -
Enhanced Feature Selection Based on Integration Containment Neighborhoods Rough Set Approximations and Binary Honey Badger Optimization
por: Hosny, Rodyna A., et al.
Publicado: (2022) -
Approximate Reaction Systems Based on Rough Set Theory
por: Campagner, Andrea, et al.
Publicado: (2020) -
Rough interfaces beyond the Gaussian approximation
por: Caselle, M., et al.
Publicado: (1994) -
Getting trapped in a rough neighborhood
por: Dove, Alan W.
Publicado: (2002)