On the O(n3) algorithm for checking the strong robustness of interval fuzzy matrices

被引：29
|
作者：
Plavka, Jan [1 ]
机构：
[1] Tech Univ, Dept Math & Theoret Informat, Fac Elect Engn & Informat, Kosice 04200, Slovakia
来源：
DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 4-5期
关键词：
Robustness; Fuzzy matrices; SYSTEMS;
D O I：
10.1016/j.dam.2011.11.010
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Strongly robust interval matrices over (max, min)-algebra (fuzzy matrices) are studied and strong robustness properties are proved, similar to those of classical fuzzy matrices. It is shown that a strong robustness of an interval fuzzy matrix is well-defined using the definition of classical strong robustness. Characterization of strong robustness of interval fuzzy matrices is presented and an O(n(3)) algorithm for checking the strong robustness of interval fuzzy matrices is described. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：640 / 647
页数：8
相关论文
共 50 条
  • [41] Sorting permutations with transpositions in O(n3) amortized time
    Chitturi, Bhadrachalam
    Das, Priyanshu
    THEORETICAL COMPUTER SCIENCE, 2019, 766 : 30 - 37
  • [42] THE CRYSTAL-STRUCTURES OF KCD(N3)3.H2O AND K2CD(N3)4
    CLEGG, W
    KRISCHNER, H
    SARACOGLU, AI
    SHELDRICK, GM
    ZEITSCHRIFT FUR KRISTALLOGRAPHIE, 1982, 161 (3-4): : 307 - 313
  • [43] An O(n3)-Time Algorithm for the Min-Gap Unit-Length Job Scheduling Problem
    Li, Fei
    COMPUTING AND COMBINATORICS, COCOON 2022, 2022, 13595 : 476 - 487
  • [44] Model complexes for mononuclear manganese enzymes with N3 and N3O environments
    Mullins, Christopher S.
    Pecoraro, Vincent L.
    Scarpellini, Marciela
    Gaetjens, Jessica
    Kampf, Jeff W.
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2007, 233 : 826 - 826
  • [45] Nucleophilic N1→N3 rearrangement of 5′-O-trityl-O2,3′-cycloanhydrothymidine
    Yang, XB
    Misiura, K
    Stec, WJ
    Potrzebowski, MJ
    Kazmierski, S
    Wieczorek, M
    Majzner, WR
    Bujacz, GD
    NUCLEOSIDES NUCLEOTIDES & NUCLEIC ACIDS, 2000, 19 (10-12): : 1657 - 1673
  • [46] A Simple, Practical and Complete O(n3/log n)-Time Algorithm for RNA Folding Using the Four-Russians Speedup
    Frid, Yelena
    Gusfield, Dan
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2009, 5724 : 97 - 107
  • [47] A simple, practical and complete O(n3/log n)-time Algorithm for RNA folding using the Four-Russians Speedup
    Frid, Yelena
    Gusfield, Dan
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2010, 5
  • [48] AN O(N3LOG N) DETERMINISTIC AND AN O(N3) LAS-VEGAS ISOMORPHISM TEST FOR TRIVALENT GRAPHS
    GALIL, Z
    HOFFMANN, CM
    LUKS, EM
    SCHNORR, CP
    WEBER, A
    JOURNAL OF THE ACM, 1987, 34 (03) : 513 - 531
  • [49] An O(N3) implementation of Hedin's GW approximation for molecules
    Foerster, D.
    Koval, P.
    Sanchez-Portal, D.
    JOURNAL OF CHEMICAL PHYSICS, 2011, 135 (07):
  • [50] Alignment with non-overlapping inversions in O(n3)-time
    Vellozo, Augusto F.
    Alves, Carlos E. R.
    do Lago, Alair Pereira
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2006, 4175 : 186 - 196
12345