Depth-first method for attack graph generation

被引：0
|
作者：
Information Security Research Center, Harbin Engineering University, Harbin 150001, China [1 ]
不详 [2 ]
机构：
来源：
Jilin Daxue Xuebao (Gongxueban) | 2009年 / 2卷 / 446-452期
关键词：
13;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] A feasible method to find areas with constraints using hierarchical depth-first clustering
    Yang, KS
    Yang, RX
    Kafatos, M
    THIRTEENTH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2001, : 257 - 262
  • [32] A depth-first adaptive KNN searching algorithm
    Yu, Xiaopeng
    Yu, Xiaogao
    Zhou, Deyi
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 741 - 741
  • [33] Depth-First Search Encoding of RNA Substructures
    Chen, Qingfeng
    Lan, Chaowang
    Li, Jinyan
    Chen, Baoshan
    Wang, Lusheng
    Zhang, Chengqi
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2016, PT I, 2016, 9771 : 328 - 334
  • [34] Depth-First Net Unfoldings and Equivalent Reduction
    Yang, Xu
    Ye, Chen
    Chen, Yijun
    SYMMETRY-BASEL, 2023, 15 (09):
  • [35] A negative result on depth-first net unfoldings
    Esparza J.
    Kanade P.
    Schwoon S.
    Int. J. Softw. Tools Technol. Trans., 2008, 2 (161-166): : 161 - 166
  • [36] Anytime AND/OR Depth-First Search for Combinatorial Optimization
    Otten, Lars
    Dechter, Rina
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2014, 2014, 8656 : 933 - 937
  • [37] Optimal depth-first strategies for and-or trees
    Greiner, R
    Hayward, R
    Molloy, M
    EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 725 - 730
  • [38] Depth-First: Walking the Web of Chemical Information
    Mayer, Marina
    KEMIJA U INDUSTRIJI-JOURNAL OF CHEMISTS AND CHEMICAL ENGINEERS, 2008, 57 (02): : 70 - 71
  • [39] DEPTH-FIRST SEARCH AND KURATOWSKI SUBGRAPHS.
    Williamson, S.G.
    1600, (31):
  • [40] Anytime AND/OR depth-first search for combinatorial optimization
    Otten, Lars
    Dechter, Rina
    AI COMMUNICATIONS, 2012, 25 (03) : 211 - 227
12345