PARALLEL COMPLEXITY OF MAXIMAL PATH COVER PROBLEMS FOR DIRECTED ACYCLIC GRAPHS

被引：0
|
作者：
YAMAGAMI, K
YAKU, T
UEMURA, K
机构：
[1] TOKYO DENKI UNIV,DEPT INFORMAT SCI,TOKYO,SAITAMA 350,JAPAN
[2] TSURU UNIV,TSURU 402,JAPAN
来源：
SYSTEMS AND COMPUTERS IN JAPAN | 1994年 / 25卷 / 12期
关键词：
A PATH COVER; GRAPH ALGORITHM; PARALLEL COMPLEXITY; ALTERNATE GRAPH; BIPARTITE GRAPH;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem of covering an acyclic directed graph (DAG) with node disjoint paths is discussed. Such a ''path cover'' is called ''maximal'' if the number of paths is minimum. The parallel computational complexity for the problem of finding a maximal path cover for a DAG [3-7, 9, 13, 17] is studied and the problem is shown to belong to class NC when either in-degree or out-degree is at most 2. From this result it can be shown that the maximal bipartite matching problem is also in class NC when the degree of one of the node sets is at most 2.
引用
收藏
页码：23 / 32
页数：10
相关论文
共 50 条
  • [1] COMPLEXITY OF PROBLEMS RELATIVE TO ACYCLIC DIRECTED-GRAPHS
    BORDAT, JP
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (02): : 181 - 197
  • [2] On the complexity of path problems in properly colored directed graphs
    Donatella Granata
    Behnam Behdani
    Panos M. Pardalos
    [J]. Journal of Combinatorial Optimization, 2012, 24 : 459 - 467
  • [3] On the complexity of path problems in properly colored directed graphs
    Granata, Donatella
    Behdani, Behnam
    Pardalos, Panos M.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (04) : 459 - 467
  • [4] Directed Path Partition Problem on Directed Acyclic Graphs
    Eto, Hiroshi
    Kawaharada, Shunsuke
    Lin, Guohui
    Miyano, Eiji
    Ozdemir, Tugce
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2024, 2024, 14764 : 314 - 326
  • [5] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN DIRECTED-GRAPHS
    LUCAS, JM
    SACKROWITZ, MG
    [J]. ALGORITHMICA, 1992, 7 (5-6) : 631 - 648
  • [6] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN DIRECTED-GRAPHS
    LUCAS, JM
    SACKROWITZ, MG
    [J]. SPAA 89: PROCEEDINGS OF THE 1989 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, 1989, : 369 - 378
  • [7] A PARALLEL SEARCH ALGORITHM FOR DIRECTED ACYCLIC GRAPHS
    GHOSH, RK
    BHATTACHARJEE, GP
    [J]. BIT, 1984, 24 (02): : 134 - 150
  • [8] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN PLANAR DIRECTED-GRAPHS
    LINGAS, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 447 - 457
  • [9] On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs
    Shchekalev, M. I.
    Bokov, G. V.
    Kudryavtsev, V. B.
    [J]. MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2021, 76 (01) : 35 - 36
  • [10] On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs
    M. I. Shchekalev
    G. V. Bokov
    V. B. Kudryavtsev
    [J]. Moscow University Mathematics Bulletin, 2021, 76 : 35 - 36
12345