EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN PLANAR DIRECTED-GRAPHS

被引：0
|
作者：
LINGAS, A
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 450卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：447 / 457
页数：11
相关论文
共 50 条
  • [21] RECENT PROBLEMS AND RESULTS ABOUT KERNELS IN DIRECTED-GRAPHS
    BERGE, C
    DUCHET, P
    DISCRETE MATHEMATICS, 1990, 86 (1-3) : 27 - 31
  • [22] ON GRACEFUL DIRECTED-GRAPHS
    BLOOM, GS
    HSU, DF
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (03): : 519 - 536
  • [23] HOMOGENEOUS DIRECTED-GRAPHS
    CHERLIN, GL
    JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 296 - 296
  • [24] DECOMPOSITION OF DIRECTED-GRAPHS
    CUNNINGHAM, WH
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02): : 214 - 228
  • [25] Space efficient algorithms for directed series-parallel graphs
    Jakoby, Andreas
    Liskiewicz, Maciej
    Reischuk, Ruediger
    JOURNAL OF ALGORITHMS, 2006, 60 (02) : 85 - 114
  • [26] OPTIMAL RESOLUTION SEQUENCE OF PROBLEMS MODELED BY DIRECTED-GRAPHS
    MONTAGNA, JM
    IRIBARREN, OA
    MATHEMATICAL AND COMPUTER MODELLING, 1988, 10 (07) : 515 - 521
  • [27] A BROWSER FOR DIRECTED-GRAPHS
    ROWE, LA
    DAVIS, M
    MESSINGER, E
    MEYER, C
    SPIRAKIS, C
    TUAN, A
    SOFTWARE-PRACTICE & EXPERIENCE, 1987, 17 (01): : 61 - 76
  • [28] LINEAR-PROCESSOR NC ALGORITHMS FOR PLANAR DIRECTED-GRAPHS .1. STRONGLY CONNECTED COMPONENTS
    KAO, MY
    SIAM JOURNAL ON COMPUTING, 1993, 22 (03) : 431 - 459
  • [29] SMALL DIRECTED-GRAPHS AS NEIGHBORHOOD GRAPHS
    ZELINKA, B
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1988, 38 (02) : 269 - 273
  • [30] PARALLEL COMPLEXITY OF MAXIMAL PATH COVER PROBLEMS FOR DIRECTED ACYCLIC GRAPHS
    YAMAGAMI, K
    YAKU, T
    UEMURA, K
    SYSTEMS AND COMPUTERS IN JAPAN, 1994, 25 (12) : 23 - 32
12345