An improved algorithm on the content of realizable fuzzy matrices

DOI10.1007/s00500-011-0697-0zbMath1246.65074OpenAlexW2090766445MaRDI QIDQ416271

Yan Mo, Xue-ping Wang

Publication date: 10 May 2012

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

Full work available at URL: https://doi.org/10.1007/s00500-011-0697-0

zbMATH Keywords

algorithmcomputational complexitySchein rankmin-max compositionmatrix contentrealizable fuzzy matrix

Mathematics Subject Classification ID

Related Items (2)

Decomposition of realizable fuzzy relations ⋮ Cliques and clique covers in fuzzy graphs1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When is a fuzzy relation decomposable in two fuzzy sets?
• The least upper bound of content for realizable matrices on lattice \([0,1\)]
• Optimization schemes for decomposition of fuzzy relations
• DECOMPOSITION PROBLEM OF FUZZY RELATIONS
• Resolution of composite fuzzy relation equations
• Products of Zero-One Matrices

This page was built for publication: An improved algorithm on the content of realizable fuzzy matrices