COUNTING AND SELECTING AT RANDOM BIPARTITE GRAPHS WITH FIXED DEGREES

被引：0
|
作者：
GUENOCHE, A
机构：
来源：
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH | 1990年 / 24卷 / 01期
关键词：
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：1 / 14
页数：14
相关论文
共 50 条
  • [41] Bipartite Graphs with the Maximum Sum of Squares of Degrees
    Sheng-gui ZHANG
    Chun-cao ZHOU
    Acta Mathematicae Applicatae Sinica, 2014, (03) : 801 - 806
  • [42] The choice number of random bipartite graphs
    Noga Alon
    Michael Krivelevich
    Annals of Combinatorics, 1998, 2 (4) : 291 - 297
  • [43] Partial degrees on matchings for cycles in bipartite graphs
    Wang, Hong
    DISCRETE MATHEMATICS, 2024, 347 (10)
  • [44] Counting loopy graphs with given degrees
    Greenhill, Catherine
    McKay, Brendan D.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 436 (04) : 901 - 926
  • [45] On plane bipartite graphs without fixed edges
    Salem, Khaled
    Klavzar, Sandi
    APPLIED MATHEMATICS LETTERS, 2007, 20 (07) : 813 - 816
  • [46] Accelerated butterfly counting with vertex priority on bipartite graphs
    Kai Wang
    Xuemin Lin
    Lu Qin
    Wenjie Zhang
    Ying Zhang
    The VLDB Journal, 2023, 32 : 257 - 281
  • [47] Counting independent sets in graphs with bounded bipartite pathwidth
    Dyer, Martin
    Greenhill, Catherine
    Muller, Haiko
    RANDOM STRUCTURES & ALGORITHMS, 2021, 59 (02) : 204 - 237
  • [48] Counting Induced 6-Cycles in Bipartite Graphs
    Niu, Jason
    Zola, Jaroslaw
    Sanyuce, Ahmet Erdem
    51ST INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2022, 2022,
  • [49] Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth
    Dyer, Martin
    Greenhill, Catherine
    Mueller, Haiko
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 298 - 310
  • [50] Counting independent sets in tree convex bipartite graphs
    Lin, Min-Sheng
    Chen, Chien-Min
    DISCRETE APPLIED MATHEMATICS, 2017, 218 : 113 - 122
12345