Decomposition of realizable fuzzy relations

DOI10.1007/s00500-012-0911-8zbMath1269.03054OpenAlexW2025578860MaRDI QIDQ1955454

Xue-ping Wang, Yan Yang, Qing-You Liu

Publication date: 11 June 2013

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-012-0911-8

zbMATH Keywords

chromatic numbersimple graphcompatible partitionrealizable fuzzy relation

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved algorithm on the content of realizable fuzzy matrices
• Enumerating maximal independent sets with applications to graph colouring.
• On the chromatic number of random graphs
• Chromatic coloring with a maximum color class
• Adaptable chromatic number of graph products
• When is a fuzzy relation decomposable in two fuzzy sets?
• General decomposition problem of fuzzy relations
• The least upper bound of content for realizable matrices on lattice \([0,1\)]
• How to calculate the content for a given realizable fuzzy matrix
• Two iterative methods of decomposition of a fuzzy relation for image compression/decompression processing
• On the convergence exponent of decomposable relations
• Genetic and hybrid algorithms for graph coloring
• Optimization schemes for decomposition of fuzzy relations
• Hybrid evolutionary algorithms for graph coloring
• The general \(\alpha \)-decomposition problem of fuzzy relations
• DECOMPOSITION PROBLEM OF FUZZY RELATIONS
• Set Partitioning via Inclusion-Exclusion
• 3-coloring in time
• Relational concept learning by cooperative evolution
• A lower bound on the chromatic number of Mycielski graphs

This page was built for publication: Decomposition of realizable fuzzy relations