Works matching DE "SPARSE graphs"


Results: 432
    1
    2

    Temporal graph patterns by timed automata.

    Published in:
    VLDB Journal International Journal on Very Large Data Bases, 2024, v. 33, n. 1, p. 25, doi. 10.1007/s00778-023-00795-z
    By:
    • Aghasadeghi, Amir;
    • Van den Bussche, Jan;
    • Stoyanovich, Julia
    Publication type:
    Article
    3
    4
    5
    6

    Shifted-Antimagic Labelings for Graphs.

    Published in:
    Graphs & Combinatorics, 2021, v. 37, n. 3, p. 1065, doi. 10.1007/s00373-021-02305-w
    By:
    • Chang, Fei-Huang;
    • Chen, Hong-Bin;
    • Li, Wei-Tian;
    • Pan, Zhishi
    Publication type:
    Article
    7

    On Low Tree-Depth Decompositions.

    Published in:
    Graphs & Combinatorics, 2015, v. 31, n. 6, p. 1941, doi. 10.1007/s00373-015-1569-7
    By:
    • Nešetřil, Jaroslav;
    • Ossona de Mendez, Patrice
    Publication type:
    Article
    8
    9
    10
    11

    A component lasso.

    Published in:
    Canadian Journal of Statistics, 2015, v. 43, n. 4, p. 624, doi. 10.1002/cjs.11267
    By:
    • Hussami, Nadine;
    • Tibshirani, Robert J.
    Publication type:
    Article
    12
    13
    14
    15
    16

    Linear list r-hued coloring of sparse graphs.

    Published in:
    Discrete Mathematics, Algorithms & Applications, 2018, v. 10, n. 4, p. N.PAG, doi. 10.1142/S1793830918500453
    By:
    • Ma, Hongping;
    • Hu, Xiaoxue;
    • Kong, Jiangxu;
    • Xu, Murong
    Publication type:
    Article
    17

    Injective edge coloring of sparse graphs.

    Published in:
    Discrete Mathematics, Algorithms & Applications, 2018, v. 10, n. 2, p. -1, doi. 10.1142/S1793830918500222
    By:
    • Bu, Yuehua;
    • Qi, Chentao
    Publication type:
    Article
    18

    The linear 2-arboricity of sparse graphs.

    Published in:
    Discrete Mathematics, Algorithms & Applications, 2017, v. 9, n. 4, p. -1, doi. 10.1142/S1793830917500471
    By:
    • Li, Yuanchao;
    • Hu, Xiaoxue
    Publication type:
    Article
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34

    Twin‐width of random graphs.

    Published in:
    Random Structures & Algorithms, 2024, v. 65, n. 4, p. 794, doi. 10.1002/rsa.21247
    By:
    • Ahn, Jungho;
    • Chakraborti, Debsoumya;
    • Hendrey, Kevin;
    • Kim, Donggyu;
    • Oum, Sang‐il
    Publication type:
    Article
    35
    36
    37

    Cycle lengths in randomly perturbed graphs.

    Published in:
    Random Structures & Algorithms, 2023, v. 63, n. 4, p. 867, doi. 10.1002/rsa.21170
    By:
    • Aigner‐Horev, Elad;
    • Hefetz, Dan;
    • Krivelevich, Michael
    Publication type:
    Article
    38
    39
    40

    Majority dynamics on sparse random graphs.

    Published in:
    Random Structures & Algorithms, 2023, v. 63, n. 1, p. 171, doi. 10.1002/rsa.21139
    By:
    • Chakraborti, Debsoumya;
    • Han Kim, Jeong;
    • Lee, Joonkyung;
    • Tran, Tuan
    Publication type:
    Article
    41

    The largest hole in sparse random graphs.

    Published in:
    Random Structures & Algorithms, 2022, v. 61, n. 4, p. 666, doi. 10.1002/rsa.21078
    By:
    • Draganić, Nemanja;
    • Glock, Stefan;
    • Krivelevich, Michael
    Publication type:
    Article
    42
    43
    44

    Cycle lengths in sparse random graphs.

    Published in:
    Random Structures & Algorithms, 2022, v. 61, n. 3, p. 444, doi. 10.1002/rsa.21067
    By:
    • Alon, Yahav;
    • Krivelevich, Michael;
    • Lubetzky, Eyal
    Publication type:
    Article
    45
    46
    47

    Covering cycles in sparse graphs.

    Published in:
    Random Structures & Algorithms, 2022, v. 60, n. 4, p. 716, doi. 10.1002/rsa.21045
    By:
    • Mousset, Frank;
    • Škorić, Nemanja;
    • Trujić, Miloš
    Publication type:
    Article
    48
    49
    50