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 条
  • [1] A fast parallel algorithm to recognize P4-sparse graphs
    Lin, R
    Olariu, S
    [J]. DISCRETE APPLIED MATHEMATICS, 1998, 81 (1-3) : 191 - 215
  • [2] Fast Parallel Algorithm For Unfolding Of Communities In Large Graphs
    Wickramaarachchi, Charith
    Frincu, Marc
    Small, Patrick
    Prasanna, Viktor K.
    [J]. 2014 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2014,
  • [3] ANTITWINS IN PARTITIONABLE GRAPHS
    MAFFRAY, F
    [J]. DISCRETE MATHEMATICS, 1993, 112 (1-3) : 275 - 278
  • [4] A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
    Sarkozy, Gabor N.
    [J]. DISCRETE MATHEMATICS, 2009, 309 (06) : 1611 - 1622
  • [5] A FAST PARALLEL ALGORITHM FOR 6-COLORING OF PLANAR GRAPHS
    DIKS, K
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 273 - 282
  • [6] UNIQUELY PARTITIONABLE GRAPHS
    BOLLOBAS, B
    THOMASON, AG
    [J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1977, 16 (DEC): : 403 - 410
  • [7] Perfect graphs, partitionable graphs and cutsets
    Conforti, M
    Cornuéjols, G
    Gasparyan, G
    Vuskovic, K
    [J]. COMBINATORICA, 2002, 22 (01) : 19 - 33
  • [8] Perfect Graphs, Partitionable Graphs and Cutsets
    Michele Conforti
    Gérard Cornuéjols
    Grigor Gasparyan
    Kristina Vušković
    [J]. Combinatorica, 2002, 22 : 19 - 33
  • [9] A Recognition Algorithm for a Class of Partitionable Graphs that Satisfies the Normal Graph Conjecture
    Talmaciu, Mihai
    Nechita, Elena
    Crisan, Gloria-Cerasela
    [J]. STUDIES IN INFORMATICS AND CONTROL, 2009, 18 (04): : 349 - 354
  • [10] A simple and fast parallel coloring algorithm for distance-hereditary graphs
    Hsieh, SY
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (12) : 1201 - 1208
12345