A SIMPLE NC ALGORITHM TO RECOGNIZE WEAKLY TRIANGULATED GRAPHS

被引：0
|
作者：
OLARIU, S
机构：
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1989年 / 30卷 / 3-4期
关键词：
D O I：
10.1080/00207168908803775
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：129 / 131
页数：3
相关论文
共 50 条
  • [1] WEAKLY TRIANGULATED GRAPHS
    HAYWARD, RB
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 39 (03) : 200 - 209
  • [2] AN NC ALGORITHM TO RECOGNIZE HHD-FREE GRAPHS
    OLARIU, S
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 31 (3-4) : 177 - 185
  • [3] ALGORITHMS FOR WEAKLY TRIANGULATED GRAPHS
    SPINRAD, J
    SRITHARAN, R
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 59 (02) : 181 - 191
  • [4] OPTIMIZING WEAKLY TRIANGULATED GRAPHS
    HAYWARD, R
    HOANG, C
    MAFFRAY, F
    [J]. GRAPHS AND COMBINATORICS, 1989, 5 (04) : 339 - 349
  • [5] Weakly triangulated comparability graphs
    Eschen, E
    Hayward, RB
    Spinrad, J
    Sritharan, R
    [J]. SIAM JOURNAL ON COMPUTING, 1999, 29 (02) : 378 - 386
  • [6] Generating weakly triangulated graphs
    Hayward, R
    [J]. JOURNAL OF GRAPH THEORY, 1996, 21 (01) : 67 - 69
  • [7] Linear layouts of weakly triangulated graphs
    Mukhopadhyay, Asish
    Rao, S. V.
    Pardeshi, Sidharth
    Gundlapalli, Srinivas
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2016, 8 (03)
  • [8] Linear Layouts of Weakly Triangulated Graphs
    Mukhopadhyay, Asish
    Rao, S. V.
    Pardeshi, Sidharth
    Gundlapalli, Srinivas
    [J]. ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 322 - 336
  • [9] Recognizing weakly triangulated graphs by edge separability
    Berry, A
    Bordat, JP
    Heggernes, P
    [J]. ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 139 - 149
  • [10] A SIMPLE LINEAR TIME ALGORITHM TO RECOGNIZE INTERVAL-GRAPHS
    KORTE, N
    MOHRING, RH
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 246 : 1 - 16
12345