Recognizing i-triangulated graphs in O(mn) time

被引：1
|
作者：
Roussel, F [1 ]
Rusu, I [1 ]
机构：
[1] Univ Orleans, LIFO, F-45067 Orleans 2, France
来源：
INFORMATION PROCESSING LETTERS | 2000年 / 76卷 / 03期
关键词：
recognition algorithm; breadth-first search; i-triangulated graph; algorithms;
D O I：
10.1016/S0020-0190(00)00138-1
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We use breadth-first search and contractions of subgraphs to give a new and faster algorithm to recognize i-triangulated graphs. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：141 / 147
页数：7
相关论文
共 50 条
  • [1] ON KERNELS IN I-TRIANGULATED GRAPHS
    MAFFRAY, F
    [J]. DISCRETE MATHEMATICS, 1986, 61 (2-3) : 247 - 251
  • [2] A linear algorithm to color i-triangulated graphs
    Roussel, F
    Rusu, I
    [J]. INFORMATION PROCESSING LETTERS, 1999, 70 (02) : 57 - 62
  • [3] New characterizations of Gallai's i-triangulated graphs
    McKee, Terry A.
    [J]. DISCRETE MATHEMATICS, 2017, 340 (12) : 2941 - 2945
  • [4] Recognizing quasi-triangulated graphs
    Spinrad, JP
    [J]. DISCRETE APPLIED MATHEMATICS, 2004, 138 (1-2) : 203 - 213
  • [5] Recognizing Visibility Graphs of Triangulated Irregular Networks
    Boomari, Hossein
    Ostovari, Mojtaba
    Zarei, Alireza
    [J]. FUNDAMENTA INFORMATICAE, 2021, 179 (04) : 345 - 360
  • [6] Recognizing weakly triangulated graphs by edge separability
    Berry, A
    Bordat, JP
    Heggernes, P
    [J]. ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 139 - 149
  • [7] Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
    Addario-Berry, Louigi
    Kennedy, W. S.
    King, Andrew D.
    Li, Zhentao
    Reed, Bruce
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (07) : 765 - 770
  • [8] Recognizing Threshold Tolerance Graphs in O(n2) Time
    Golovach, Petr A.
    Heggernes, Pinar
    Lindzey, Nathan
    McConnell, Ross M.
    dos Santos, Vinicius Fernandes
    Spinrad, Jeremy P.
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 214 - 224
  • [9] Recognizing line-polar bipartite graphs in time O(n)
    Ekim, Tinaz
    Huang, Jing
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (15) : 1593 - 1598
  • [10] RECOGNIZING STRICT 2-THRESHOLD GRAPHS IN O(M) TIME
    PETRESCHIM, R
    STERBINI, A
    [J]. INFORMATION PROCESSING LETTERS, 1995, 54 (04) : 193 - 198
12345