An improved algorithm on the content of realizable fuzzy matrices

DOI10.1007/S00500-011-0697-0zbMATH Open1246.65074OpenAlexW2090766445MaRDI QIDQ416271FDOQ416271

Yan Mo, Xueping 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

Recommendations

• How to calculate the content for a given realizable fuzzy matrix
• The sub-content for a sub-symmetric fuzzy matrix
• scientific article; zbMATH DE number 3906654
• scientific article; zbMATH DE number 1544998
• Decomposition of realizable fuzzy relations

zbMATH Keywords

computational complexityalgorithmSchein rankmin-max compositionmatrix contentrealizable fuzzy matrix

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Fuzzy matrices (15B15)

Cites Work

• Title not available (Why is that?)
• Resolution of composite fuzzy relation equations
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computational complexity of the Schein rank of fuzzy matrices
• Products of Zero-One Matrices

Cited In (6)

• The sub-content for a sub-symmetric fuzzy matrix
• Title not available (Why is that?)
• Cliques and clique covers in fuzzy graphs1
• Title not available (Why is that?)
• Decomposition of realizable fuzzy relations
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q416271)