COMPLEXITY OF PROBLEMS RELATIVE TO ACYCLIC DIRECTED-GRAPHS

被引：2

|

作者：

BORDAT, JP

机构：

来源：

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 1987年 / 21卷 / 02期

关键词：

D O I：

10.1051/ita/1987210201811

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：181 / 197

页数：17

相关论文

共 50 条

[1] MOBIUS-INVERSION OF RANDOM ACYCLIC DIRECTED-GRAPHS
COHEN, JE
[J]. STUDIES IN APPLIED MATHEMATICS, 1991, 84 (01) : 1 - 6
[2] SOLUTION OF ASSIGNMENT PROBLEMS BY DIRECTED-GRAPHS
SUITS, DB
[J]. JOURNAL OF FARM ECONOMICS, 1957, 39 (04): : 975 - 983
[3] PARALLEL COMPLEXITY OF MAXIMAL PATH COVER PROBLEMS FOR DIRECTED ACYCLIC GRAPHS
YAMAGAMI, K
YAKU, T
UEMURA, K
[J]. SYSTEMS AND COMPUTERS IN JAPAN, 1994, 25 (12) : 23 - 32
[4] QUALITATIVE INDEPENDENCE AND SPERNER PROBLEMS FOR DIRECTED-GRAPHS
GARGANO, L
KORNER, J
VACCARO, U
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1992, 61 (02) : 173 - 192
[5] THE EFFECT OF 2 CYCLES ON THE COMPLEXITY OF COLOURINGS BY DIRECTED-GRAPHS
BANGJENSEN, J
HELL, P
[J]. DISCRETE APPLIED MATHEMATICS, 1990, 26 (01) : 1 - 23
[6] DIRECTED TRIANGLES IN DIRECTED-GRAPHS
DEGRAAF, M
SCHRIJVER, A
SEYMOUR, PD
[J]. DISCRETE MATHEMATICS, 1992, 110 (1-3) : 279 - 282
[7] RECENT PROBLEMS AND RESULTS ABOUT KERNELS IN DIRECTED-GRAPHS
BERGE, C
DUCHET, P
[J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 27 - 31
[8] ON GRACEFUL DIRECTED-GRAPHS
BLOOM, GS
HSU, DF
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (03): : 519 - 536
[9] 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
[10] HOMOGENEOUS DIRECTED-GRAPHS
CHERLIN, GL
[J]. JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 296 - 296

← 1 2 3 4 5 →