Algorithm of finding cutsets of sparse simple connected graphs

被引：0
|
作者：
机构：
来源：
Jiche Dianchuandong | / 2卷 / 3-5期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] Vertex cutsets of undirected graphs
    Patvardhan, C., 1600, IEEE, Piscataway, NJ, United States (44):
  • [42] Ehrhart Series for Connected Simple Graphs
    Tetsushi Matsui
    Graphs and Combinatorics, 2013, 29 : 617 - 635
  • [43] Edge Realizability of Connected Simple Graphs
    Hansen, Pierre
    Hertz, Alain
    Sellal, Cherif
    VukieeviC, Damir
    Aouchichel, Mustapha
    Caporossil, Gilles
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2017, 78 (03) : 689 - 712
  • [44] Ehrhart Series for Connected Simple Graphs
    Matsui, Tetsushi
    GRAPHS AND COMBINATORICS, 2013, 29 (03) : 617 - 635
  • [45] CONNECTED SIMPLE GRAPHS AND A SELECTION PROBLEM
    JONES, FB
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1975, 25 (02) : 300 - 301
  • [46] Matching cutsets in graphs of diameter 2
    Borowiecki, Mieuyslaw
    Jesse-Jozefczyk, Katarzyna
    THEORETICAL COMPUTER SCIENCE, 2008, 407 (1-3) : 574 - 582
  • [47] Antichain Cutsets of Strongly Connected Posets
    Foldes, Stephan
    Woodroofe, Russ
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2013, 30 (02): : 351 - 361
  • [48] Cutsets in a k-connected graph
    Karpov D.V.
    Journal of Mathematical Sciences, 2007, 145 (3) : 4953 - 4966
  • [49] STAR-CUTSETS AND PERFECT GRAPHS
    CHVATAL, V
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 39 (03) : 189 - 199
  • [50] Asymptotic enumeration of sparse 2-connected graphs
    Kemkes, Graeme
    Sato, Cristiane M.
    Wormald, Nicholas
    RANDOM STRUCTURES & ALGORITHMS, 2013, 43 (03) : 354 - 376
12345