共 50 条
- [31] On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs Moscow University Mathematics Bulletin, 2021, 76 : 35 - 36
- [34] Efficient Algorithms for Listing k Disjoint st-Paths in Graphs LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 544 - 557
- [35] COMPLEXITY OF PROBLEMS RELATIVE TO ACYCLIC DIRECTED-GRAPHS RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (02): : 181 - 197
- [38] Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs Theory of Computing Systems, 2016, 58 : 45 - 59
- [40] Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 11334 - 11342