A LINEAR-TIME ALGORITHM FOR ISOMORPHISM OF A SUBCLASS OF CHORDAL GRAPHS

被引：2
|
作者：
VEERARAGHAVULU, NC [1 ]
KUMAR, PS [1 ]
MADHAVAN, CEV [1 ]
机构：
[1] INDIAN INST SCI, DEPT COMP SCI & AUTOMAT, BANGALORE 560012, KARNATAKA, INDIA
来源：
INFORMATION PROCESSING LETTERS | 1992年 / 44卷 / 01期
关键词：
DESIGN OF ALGORITHMS; GRAPH ISOMORPHISM PROBLEM; CHORDAL GRAPHS;
D O I：
10.1016/0020-0190(92)90254-S
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
[No abstract available]
引用
收藏
页码：45 / 49
页数：5
相关论文
共 50 条
  • [1] A linear-time algorithm for semitotal domination in strongly chordal graphs
    Tripathi, Vikash
    Pandey, Arti
    Maheshwari, Anil
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 338 : 77 - 88
  • [2] A LINEAR-TIME ALGORITHM FOR ISOMORPHISM OF GRAPHS OF BOUNDED AVERAGE GENUS
    CHEN, JN
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (04) : 614 - 631
  • [3] Linear-Time Generation of Random Chordal Graphs
    Seker, Oylum
    Heggernes, Pinar
    Ekim, Tinaz
    Taskin, Z. Caner
    [J]. ALGORITHMS AND COMPLEXITY (CIAC 2017), 2017, 10236 : 442 - 453
  • [4] A linear-time algorithm for paired-domination problem in strongly chordal graphs
    Chen, Lei
    Lu, Changhong
    Zeng, Zhenbing
    [J]. INFORMATION PROCESSING LETTERS, 2009, 110 (01) : 20 - 23
  • [5] An implicit representation of chordal comparabilty graphs in linear-time
    Curtis, Andrew R.
    Izurieta, Clemente
    Joeris, Benson
    Lundberg, Scott
    McConnell, Ross M.
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 168 - +
  • [6] Linear-time counting algorithms for independent sets in chordal graphs
    Okamoto, Y
    Uno, T
    Uehara, R
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 433 - 444
  • [7] A Linear-Time Approximation Algorithm for Weighted Matchings in Graphs
    Vinkemeier, Doratha E. Drake
    Hougardy, Stefan
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (01) : 107 - 122
  • [8] A linear time algorithm to list the minimal separators of chordal graphs
    Chandran, LS
    Grandoni, F
    [J]. DISCRETE MATHEMATICS, 2006, 306 (03) : 351 - 358
  • [9] A LINEAR-TIME ALGORITHM FOR THE HOMOTOPIC ROUTING PROBLEM IN GRID GRAPHS
    KAUFMANN, M
    MEHLHORN, K
    [J]. SIAM JOURNAL ON COMPUTING, 1994, 23 (02) : 227 - 246
  • [10] A linear-time algorithm for clique-coloring planar graphs
    Liang, Zuosong
    Shan, Erfang
    Xing, Huiyu
    Bai, Chunsong
    [J]. OPERATIONS RESEARCH LETTERS, 2019, 47 (04) : 241 - 243
12345