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
关键词
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 条
  • [21] AN O(N3) ALGORITHM FOR FINDING THE MINIMAL OPAQUE FOREST OF A CONVEX POLYGON
    DUBLISH, P
    INFORMATION PROCESSING LETTERS, 1988, 29 (05) : 275 - 276
  • [22] An O(n3)-Time Recognition Algorithm for hhds-free Graphs
    Elaine M. Eschen
    Chính T. Hoàng
    R. Sritharan
    Graphs and Combinatorics, 2007, 23 : 209 - 231
  • [23] An O(n3) time algorithm for recognizing threshold dimension 2 graphs
    Sterbini, A
    Raschle, T
    INFORMATION PROCESSING LETTERS, 1998, 67 (05) : 255 - 259
  • [24] A note of an O(n3/log n) time algorithm for all pairs shortest paths
    Han, Yijie
    INFORMATION PROCESSING LETTERS, 2008, 105 (03) : 114 - 116
  • [25] A NEW KARZANOV-TYPE O(N3) MAX-FLOW ALGORITHM
    WAISSI, GR
    MATHEMATICAL AND COMPUTER MODELLING, 1992, 16 (02) : 65 - 72
  • [26] AnO(n3) recognition algorithm for bithreshold graphs
    S. De Agostino
    R. Petreschi
    A. Sterbini
    Algorithmica, 1997, 17 : 416 - 425
  • [27] UV absorption spectra of intermediates generated via photolysis of B(N3)3, BCl(N3)2, and BCl2(N3) in low-temperature argon matrices
    Travers, MJ
    Gilbert, JV
    JOURNAL OF PHYSICAL CHEMISTRY A, 2000, 104 (16): : 3780 - 3785
  • [28] An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
    Frank Dehne
    Michael Fellows
    Michael Langston
    Frances Rosamond
    Kim Stevens
    Theory of Computing Systems, 2007, 41 : 479 - 492
  • [29] An O(2O(k)n3) FPT algorithm for the undirected Feedback Vertex Set problem
    Dehne, F
    Fellows, M
    Langston, MA
    Rosamond, F
    Stevens, K
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 859 - 869
  • [30] An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem
    Dehne, Frank
    Fellows, Michael
    Langston, Michael
    Rosamond, Frances
    Stevens, Kim
    THEORY OF COMPUTING SYSTEMS, 2007, 41 (03) : 479 - 492