Decomposition of realizable fuzzy relations
From MaRDI portal
A fuzzy relation \(A\) is realizable if there exists a fuzzy relation \(B\) such that \(A=B\odot B^T\) (where \(\odot \) is the max-min composition and \(B^T\) denotes the transpose of \(B\)). The authors prove that the content of a realizable fuzzy relation is equal to the chromatic number of a simple graph generated by the realizable fuzzy relation by means of the concept of compatible partition.
Recommendations
- scientific article; zbMATH DE number 2150122
- DECOMPOSITION PROBLEM OF FUZZY RELATIONS
- Decomposition problem of fuzzy relations-further results
- General decomposition problem of fuzzy relations
- Fuzzy relation \({\alpha_R}\) decomposition
- A NOTE ON “DECOMPOSITION PROBLEM OF FUZZY RELATIONS”
- General results on the decomposition of transitive fuzzy relations
- Optimization schemes for decomposition of fuzzy relations
- scientific article; zbMATH DE number 3924778
- The general \(\alpha \)-decomposition problem of fuzzy relations
Cites work
- 3-coloring in time
- A lower bound on the chromatic number of Mycielski graphs
- Adaptable chromatic number of graph products
- An improved algorithm on the content of realizable fuzzy matrices
- Chromatic coloring with a maximum color class
- DECOMPOSITION PROBLEM OF FUZZY RELATIONS
- Enumerating maximal independent sets with applications to graph colouring.
- General decomposition problem of fuzzy relations
- Genetic and hybrid algorithms for graph coloring
- How to calculate the content for a given realizable fuzzy matrix
- scientific article; zbMATH DE number 3906654 (Why is no real title available?)
- scientific article; zbMATH DE number 3959654 (Why is no real title available?)
- scientific article; zbMATH DE number 4045808 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 4187836 (Why is no real title available?)
- Hybrid evolutionary algorithms for graph coloring
- On the chromatic number of random graphs
- On the computational complexity of the Schein rank of fuzzy matrices
- On the convergence exponent of decomposable relations
- Optimization schemes for decomposition of fuzzy relations
- Relational concept learning by cooperative evolution
- Set partitioning via inclusion-exclusion
- The general \(\alpha \)-decomposition problem of fuzzy relations
- The least upper bound of content for realizable matrices on lattice \([0,1]\)
- Two iterative methods of decomposition of a fuzzy relation for image compression/decompression processing
- When is a fuzzy relation decomposable in two fuzzy sets?
Cited in
(3)
This page was built for publication: Decomposition of realizable fuzzy relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955454)
