A new parallel computing algorithm to get the cubic subgraph for a simple graph

被引：0
|
作者：
State Key Laboratory of Simulation and Regulation of River Basin Water Cycle, China Institute of Water Resources and Hydropower Research, Beijing, China [1 ]
不详 [2 ]
不详 [3 ]
机构：
来源：
J. Comput. Theor. Nanosci. | / 10卷 / 3006-3008期
关键词：
D O I：
10.1166/jctn.2015.4072
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Optimizing Parallel Graph Connectivity Computation via Subgraph Sampling
    Sutton, Michael
    Ben-Nun, Tal
    Barak, Amnon
    [J]. 2018 32ND IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2018, : 12 - 21
  • [32] A GRAPH BISECTION ALGORITHM-BASED ON SUBGRAPH MIGRATION
    ISOMOTO, K
    MIMASA, Y
    WAKABAYASHI, S
    KOIDE, T
    YOSHIDA, N
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1994, E77A (12) : 2039 - 2044
  • [33] Median graph: A new exact algorithm using a distance based on the maximum common subgraph
    Ferrer, M.
    Valveny, E.
    Serratosa, F.
    [J]. PATTERN RECOGNITION LETTERS, 2009, 30 (05) : 579 - 588
  • [34] A parallel branch-and-bound algorithm for computing optimal task graph schedules
    Hönig, U
    Schiffmann, W
    [J]. GRID AND COOPERATIVE COMPUTING, PT 2, 2004, 3033 : 18 - 25
  • [35] A biological computing algorithm to seek the maximum degree of vertices in a simple undirected graph
    Li, Lei
    Wang, Zhaocai
    Wang, Xiaoming
    Liu, Haifeng
    [J]. Journal of Computational and Theoretical Nanoscience, 2015, 12 (10) : 3464 - 3467
  • [36] DECIDING WHETHER A PLANAR GRAPH HAS A CUBIC SUBGRAPH IS NP-COMPLETE
    STEWART, IA
    [J]. DISCRETE MATHEMATICS, 1994, 126 (1-3) : 349 - 357
  • [37] Accelerating Parallel Graph Computing with Speculation
    Ji, Shuo
    Zhao, Yinliang
    Yi, Qing
    [J]. CF '19 - PROCEEDINGS OF THE 16TH ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS, 2019, : 115 - 124
  • [38] Graph partitioning models for parallel computing
    Hendrickson, B
    Kolda, TG
    [J]. PARALLEL COMPUTING, 2000, 26 (12) : 1519 - 1534
  • [39] A new parallel algorithm for computing formal concepts based on two parallel stages
    Zou, Ligeng
    He, Tingting
    Dai, Jianhua
    [J]. INFORMATION SCIENCES, 2022, 586 : 514 - 524
  • [40] A SIMPLE PARALLEL ALGORITHM FOR COMPUTING THE DIAMETERS OF ALL VERTICES IN A TREE AND ITS APPLICATION
    CHEN, ZZ
    [J]. INFORMATION PROCESSING LETTERS, 1992, 42 (05) : 243 - 248
12345