EFFICIENTLY COMPUTING WITH DESIGN STRUCTURE MATRICES

被引：0
|
作者：
Hossain, Shahadat [1 ]
机构：
[1] Univ Lethbridge, Dept Math & Comp Sci, Lethbridge, AB T1K 3M4, Canada
来源：
MANAGING COMPLEXITY BY MODELLING DEPENDENCIES | 2010年
关键词：
sparse data structure; block triangular form; strongly connected component; depth-first search;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
引用
收藏
页码：345 / 350
页数：6
相关论文
共 50 条
  • [41] Computing Complex Temporal Join Queries Efficiently
    Hu, Xiao
    Sintos, Stavros
    Gao, Junyang
    Agarwal, Pankaj K.
    Yang, Jun
    PROCEEDINGS OF THE 2022 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA (SIGMOD '22), 2022, : 2076 - 2090
  • [42] Computing Active Subspaces Efficiently with Gradient Sketching
    Constantine, Paul G.
    Eftekhari, Armin
    Wakin, Michael B.
    2015 IEEE 6TH INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING (CAMSAP), 2015, : 353 - 356
  • [43] Efficiently computing alternative paths in game maps
    Li, Lingxiao
    Cheema, Muhammad Aamir
    Ali, Mohammed Eunus
    Lu, Hua
    Li, Huan
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2023, 26 (05): : 3321 - 3345
  • [44] Computing Distance Histograms Efficiently in Scientific Databases
    Tu, Yi-Cheng
    Chen, Shaoping
    Pandit, Sagar
    ICDE: 2009 IEEE 25TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2009, : 796 - +
  • [45] Efficiently Computing the Power Set in a Parallel Environment
    Goodwin, Roger L.
    2019 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2019, : 573 - 579
  • [46] EFFICIENTLY COMPUTING PRODUCT OF 2 BINARY RELATIONS
    VANLEEUWEN, J
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1976, 5 (03) : 193 - 201
  • [47] Computing efficiently the lattice width in any dimension
    Charrier, Emilie
    Feschet, Fabien
    Buzer, Lilian
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (36) : 4814 - 4823
  • [48] Efficiently computing the closest point to a query line
    Mitra, P
    Chaudhuri, BB
    PATTERN RECOGNITION LETTERS, 1998, 19 (11) : 1027 - 1035
  • [49] Efficiently Computing Reverse k Furthest Neighbors
    Wang, Shenlu
    Cheema, Muhammad Aamir
    Lin, Xuemin
    Zhang, Ying
    Liu, Dongxi
    2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2016, : 1110 - 1121
  • [50] Efficiently computing minimal sets of critical pairs
    Caboara, M
    Kreuzer, M
    Robbiano, L
    JOURNAL OF SYMBOLIC COMPUTATION, 2004, 38 (04) : 1169 - 1190
12345