Ring perception using breadth-first search

被引:41
|
作者
Figueras, J
机构
[1] Orleans, MA 02653
关键词
D O I
10.1021/ci960013p
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Combining breadth-first search with new ideas for uncovering embedded rings in complex systems' yields a very fast routine for ring perception. With large structures, the new routine is orders of magnitude faster than depth-first ring detection, a result expected on the basis of recent work that establishes polynomial order for BFS.(2)
引用
收藏
页码:986 / 991
页数:6
相关论文
共 50 条
  • [31] Breadth-First Search with A Multi-Core Computer
    Belova, Maryia
    Ouyang, Ming
    2017 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2017, : 579 - 587
  • [32] Fast Breadth-First Search in Still Less Space
    Hagerup, Torben
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 93 - 105
  • [33] Distributed breadth-first search LTL model checking
    Jiří Barnat
    Ivana Černá
    Formal Methods in System Design, 2006, 29 : 117 - 134
  • [34] On dynamic breadth-first search in external-memory
    Meyer, Ulrich
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 551 - 560
  • [35] Breadth-first search and the Andrews-Curtis conjecture
    Havas, G
    Ramsay, C
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2003, 13 (01) : 61 - 68
  • [36] An adaptive breadth-first search algorithm on integrated architectures
    Feng Zhang
    Heng Lin
    Jidong Zhai
    Jie Cheng
    Dingyi Xiang
    Jizhong Li
    Yunpeng Chai
    Xiaoyong Du
    The Journal of Supercomputing, 2018, 74 : 6135 - 6155
  • [37] Load-Balanced Breadth-First Search on GPUs
    Zhu, Zhe
    Li, Jianjun
    Li, Guohui
    WEB-AGE INFORMATION MANAGEMENT, WAIM 2014, 2014, 8485 : 435 - 447
  • [38] SlimSell: A Vectorizable Graph Representation for Breadth-First Search
    Besta, Maciej
    Marending, Florian
    Solomonik, Edgar
    Hoefler, Torsten
    2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2017, : 32 - 41
  • [39] Maximal Frequent Itemset Mining Using Breadth-First Search with Efficient Pruning
    Sumathi, K.
    Kannan, S.
    Nagarajan, K.
    INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND COMMUNICATION TECHNOLOGIES (ICCNCT 2018), 2019, 15 : 333 - 344
  • [40] Parallel breadth-first search LTL model-checking
    Barnat, J
    Brim, L
    Chaloupka, J
    18TH IEEE INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, PROCEEDINGS, 2003, : 106 - 115