WEAKLY TRIANGULATED GRAPHS

被引：149
|
作者：
HAYWARD, RB [1 ]
机构：
[1] MCGILL UNIV,SCH COMP SCI,MONTREAL H3A 2K6,QUEBEC,CANADA
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1985年 / 39卷 / 03期
关键词：
D O I：
10.1016/0095-8956(85)90050-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：200 / 209
页数：10
相关论文
共 50 条
  • [1] OPTIMIZING WEAKLY TRIANGULATED GRAPHS
    HAYWARD, R
    HOANG, C
    MAFFRAY, F
    GRAPHS AND COMBINATORICS, 1989, 5 (04) : 339 - 349
  • [2] Weakly triangulated comparability graphs
    Eschen, E
    Hayward, RB
    Spinrad, J
    Sritharan, R
    SIAM JOURNAL ON COMPUTING, 1999, 29 (02) : 378 - 386
  • [3] Weakly triangulated comparability graphs
    Eschen, Elaine
    Hayward, Ryan B.
    Spinrad, Jeremy
    Sritharan, R.
    SIAM Journal on Computing, 29 (02): : 378 - 386
  • [4] ALGORITHMS FOR WEAKLY TRIANGULATED GRAPHS
    SPINRAD, J
    SRITHARAN, R
    DISCRETE APPLIED MATHEMATICS, 1995, 59 (02) : 181 - 191
  • [5] Algorithms for weakly triangulated graphs
    Discrete Appl Math, 2 (181):
  • [6] Generating weakly triangulated graphs
    Hayward, R
    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
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2016, 8 (03)
  • [8] Linear Layouts of Weakly Triangulated Graphs
    Mukhopadhyay, Asish
    Rao, S. V.
    Pardeshi, Sidharth
    Gundlapalli, Srinivas
    ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 322 - 336
  • [9] Recognizing weakly triangulated graphs by edge separability
    Berry, A
    Bordat, JP
    Heggernes, P
    ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 139 - 149
  • [10] Treewidth and minimum fill-in of weakly triangulated graphs
    Bouchitté, V
    Todinca, I
    STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 197 - 206
12345