AN NC ALGORITHM TO RECOGNIZE HHD-FREE GRAPHS

被引：2
|
作者：
OLARIU, S
机构：
[1] Department of Computer Science, Old Dominion University
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1990年 / 31卷 / 3-4期
关键词：
Chordal graphs; HHD-free graphs; NC algorithms; parallel algorithms; perfect graphs;
D O I：
10.1080/00207169008803800
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The HHD-free graphs are a class of perfect graphs that strictly contain the cographs, the chordal graphs, the Matula-perfect graphs, and the Welsh-Powell opposition graphs. In this paper we present two characterizations of the HHD-free graphs and show how to use them to produce a parallel recognition algorithm which runs in O(logn) time using 0{n4) processors on a concurrent-read, concurrent-write parallel random access machine. © 1990, Taylor & Francis Group, LLC. All rights reserved.
引用
收藏
页码：177 / 185
页数：9
相关论文
共 50 条
  • [1] Convexity and HHD-free graphs
    Dragan, FF
    Nicolai, F
    Brandstädt, A
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1999, 12 (01) : 119 - 135
  • [2] Powers of HHD-free graphs
    Dragan, FF
    Nicolai, F
    Brandstädt, A
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1998, 69 (3-4) : 217 - 242
  • [3] Walk Domination and HHD-Free Graphs
    Tondato, Silvia B.
    [J]. GRAPHS AND COMBINATORICS, 2024, 40 (03)
  • [4] An O(nm)-time certifying algorithm for recognizing HHD-free graphs
    Nikolopoulos, Stavros D.
    Palios, Leonidas
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 452 : 117 - 131
  • [5] An O(nm)-time certifying algorithm for recognizing HHD-free graphs
    Nikolopoulos, Stavros D.
    Palios, Leonidas
    [J]. FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2007, 4613 : 281 - +
  • [6] Maximum induced matching problem on hhd-free graphs
    Krishnamurthy, Chandra Mohan
    Sritharan, R.
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (03) : 224 - 230
  • [7] LexBFS-orderings and powers of HHD-free graphs
    Dragan, FF
    Nicolai, F
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1999, 71 (01) : 35 - 56
  • [8] Duchet-type theorems for powers of HHD-free graphs
    Brandstadt, A
    Le, VB
    Szymczak, T
    [J]. DISCRETE MATHEMATICS, 1997, 177 (1-3) : 9 - 16
  • [9] Recognizing HHD-free and Welsh-Powell opposition graphs
    Nikolopoulos, SD
    Palios, L
    [J]. GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 105 - 116
  • [10] Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs
    Nikolopoulos, SD
    Palios, L
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2006, 8 (01): : 65 - 82
12345