Dismantling sparse random graphs

被引：0
|
作者：
Department of Mathematics, Uppsala University, PO Box 480, SE-75.1 06 Uppsala, Sweden [1 ]
不详 [2 ]
机构：
来源：
Comb. Probab. Comput. | 2008年 / 2卷 / 259-264期
关键词：
Graph theory;
D O I：
10.1017/S0963548307008802
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] FLOODING IN WEIGHTED SPARSE RANDOM GRAPHS
    Amini, Hamed
    Draief, Moez
    Lelarge, Marc
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (01) : 1 - 26
  • [22] Sparse random graphs: Eigenvalues and eigenvectors
    Tran, Linh V.
    Vu, Van H.
    Wang, Ke
    RANDOM STRUCTURES & ALGORITHMS, 2013, 42 (01) : 110 - 134
  • [23] Uniformly Random Colourings of Sparse Graphs
    Hurley, Eoin
    Pirot, Francois
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1357 - 1370
  • [24] The cover time of sparse random graphs
    Cooper, Colin
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2007, 30 (1-2) : 1 - 16
  • [25] Sparse Quasi-Random Graphs
    Fan Chung
    Ronald Graham
    Combinatorica, 2002, 22 : 217 - 244
  • [26] Sparse Graphs: Metrics and Random Models
    Bollobas, Bela
    Riordan, Oliver
    RANDOM STRUCTURES & ALGORITHMS, 2011, 39 (01) : 1 - 38
  • [27] PUSH IS FAST ON SPARSE RANDOM GRAPHS
    Meier, Florian
    Peter, Ueli
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 29 - 49
  • [28] The largest hole in sparse random graphs
    Draganic, Nemanja
    Glock, Stefan
    Krivelevich, Michael
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (04) : 666 - 677
  • [29] A note on coloring sparse random graphs
    Sommer, Christian
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3381 - 3384
  • [30] Cycle lengths in sparse random graphs
    Alon, Yahav
    Krivelevich, Michael
    Lubetzky, Eyal
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (03) : 444 - 461
12345