共 50 条
- [1] COMPLEXITY OF PROBLEMS RELATIVE TO ACYCLIC DIRECTED-GRAPHS [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (02): : 181 - 197
- [5] ON GRACEFUL DIRECTED-GRAPHS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (03): : 519 - 536
- [6] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN DIRECTED-GRAPHS [J]. SPAA 89: PROCEEDINGS OF THE 1989 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, 1989, : 369 - 378
- [8] DECOMPOSITION OF DIRECTED-GRAPHS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02): : 214 - 228
- [9] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN DIRECTED-GRAPHS [J]. ALGORITHMICA, 1992, 7 (5-6) : 631 - 648