Decomposition of realizable fuzzy relations (Q1955454): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00500-012-0911-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025578860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-coloring in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the chromatic number of Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic coloring with a maximum color class / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DECOMPOSITION PROBLEM OF FUZZY RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is a fuzzy relation decomposable in two fuzzy sets? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and hybrid algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptable chromatic number of graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational concept learning by cooperative evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The least upper bound of content for realizable matrices on lattice \([0,1]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm on the content of realizable fuzzy matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two iterative methods of decomposition of a fuzzy relation for image compression/decompression processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization schemes for decomposition of fuzzy relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: General decomposition problem of fuzzy relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to calculate the content for a given realizable fuzzy matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5435819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence exponent of decomposable relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general \(\alpha \)-decomposition problem of fuzzy relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728148 / rank
 
Normal rank

Latest revision as of 12:06, 6 July 2024

scientific article
Language Label Description Also known as
English
Decomposition of realizable fuzzy relations
scientific article

    Statements

    Decomposition of realizable fuzzy relations (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2013
    0 references
    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.
    0 references
    realizable fuzzy relation
    0 references
    simple graph
    0 references
    chromatic number
    0 references
    compatible partition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers