A FAST PARALLEL ALGORITHM TO RECOGNIZE PARTITIONABLE GRAPHS

被引：0
|
作者：
LIN, R [1 ]
OLARIU, S [1 ]
机构：
[1] OLD DOMINION UNIV,DEPT COMP SCI,NORFOLK,VA 23529
来源：
INFORMATION PROCESSING LETTERS | 1990年 / 36卷 / 03期
关键词：
brittle graphs; NC algorithms; Parallel algorithms; partionable graphs;
D O I：
10.1016/0020-0190(90)90085-C
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We define a class of graphs which generalizes the well-known class of cographs or complement-reducible graphs and show that the graphs in our class can be recognized fast in parallel. More precisely, with an arbitrary graph G with n vertices and m edges as input, the proposed recognition algorithm runs in O(log n) time using O((n2/log n)+mn) processors on an EREW parallel random access machine. © 1990.
引用
收藏
页码：153 / 157
页数：5
相关论文
共 50 条
  • [31] Scheduling issues in a partitionable parallel system
    Karatza, HD
    [J]. MODELLING AND SIMULATION 2002, 2002, : 522 - 526
  • [32] Scalable parallel algorithm for fast computation of Transitive Closure of Graphs on Shared Memory Architectures
    Patel, Sarthak
    Dave, Bhrugu
    Kumbhani, Smit
    Desai, Mihir
    Kumar, Sidharth
    Chaudhury, Bhaskar
    [J]. PROCEEDINGS OF SIXTH INTERNATIONAL IEEE WORKSHOP ON EXTREME SCALE PROGRAMMING MODELS AND MIDDLEWARE (ESPM2 2021), 2021, : 1 - 9
  • [33] Uniquely monopolar-partitionable block graphs
    Chen, Xuegang
    Huang, Jing
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (02): : 21 - 34
  • [34] Improved efficient parallel algorithms to recognize interval graphs and interval hypergraphs
    Dahlhaus, E
    [J]. THIRTIETH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL 1: SOFTWARE TECHNOLOGY AND ARCHITECTURE, 1997, : 172 - 181
  • [35] A faster algorithm to recognize even-hole-free graphs
    Chang, Hsien-Chih
    Lu, Hsueh-I
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 113 : 141 - 161
  • [36] A SIMPLE LINEAR TIME ALGORITHM TO RECOGNIZE INTERVAL-GRAPHS
    KORTE, N
    MOHRING, RH
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 246 : 1 - 16
  • [37] A NEW SIMPLE LINEAR ALGORITHM TO RECOGNIZE INTERVAL-GRAPHS
    SIMON, K
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 553 : 289 - 308
  • [38] On the structure of arbitrarily partitionable graphs with given connectivity
    Baudon, Olivier
    Foucaud, Florent
    Przybylo, Jakub
    Wozniak, Mariusz
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 162 : 381 - 385
  • [39] Graphs vertex-partitionable into strong cliques
    Hujdurovic, Ademir
    Milanic, Martin
    Ries, Bernard
    [J]. DISCRETE MATHEMATICS, 2018, 341 (05) : 1392 - 1405
  • [40] Some properties of minimal arbitrarily partitionable graphs
    Bensmail, Julien
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 86 : 149 - 168
12345