Algorithm of finding cutsets of sparse simple connected graphs

被引：0
|
作者：
机构：
来源：
Jiche Dianchuandong | / 2卷 / 3-5期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Hamilton cycles in sparse locally connected graphs
    van Aardt, Susan A.
    Burger, Alewyn P.
    Frick, Marietjie
    Thomassen, Carsten
    de Wet, Johan P.
    DISCRETE APPLIED MATHEMATICS, 2019, 257 : 276 - 288
  • [32] Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
    Storch, Tobias
    THEORETICAL COMPUTER SCIENCE, 2007, 386 (1-2) : 114 - 131
  • [33] FINDING HAMILTON CYCLES IN SPARSE RANDOM GRAPHS
    FRIEZE, AM
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 44 (02) : 230 - 250
  • [34] FINDING AND USING EXPANDERS IN LOCALLY SPARSE GRAPHS
    Krivelevich, Michael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (01) : 611 - 623
  • [35] Packing and finding paths in sparse random graphs
    Iršič, Vesna
    Portier, Julien
    Versteegen, Leo
    arXiv,
  • [36] A polynomial-time algorithm for finding regular simple paths in outerplanar graphs
    Nedev, ZP
    Wood, PT
    JOURNAL OF ALGORITHMS, 2000, 35 (02) : 235 - 259
  • [37] Finding k Shortest Simple Paths in Directed Graphs: A Node Classification Algorithm
    Feng, Gang
    NETWORKS, 2014, 64 (01) : 6 - 17
  • [38] Finding strongly connected components in distributed graphs
    McLendon, W
    Hendrickson, B
    Plimpton, SJ
    Rauchwerger, L
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (08) : 901 - 910
  • [39] A LINEAR-TIME ALGORITHM FOR FINDING A SPARSE K-CONNECTED SPANNING SUBGRAPH OF A K-CONNECTED GRAPH
    NAGAMOCHI, H
    IBARAKI, T
    ALGORITHMICA, 1992, 7 (5-6) : 583 - 596
  • [40] Skewness of Graphs with Small Cutsets
    Graham Farr
    Peter Eades
    Graphs and Combinatorics, 2003, 19 : 177 - 194
12345