共 50 条
- [2] Finding the longest simple path in cyclic combinational circuits [J]. INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 1998, : 530 - 535
- [4] EFFICIENT ALGORITHMS FOR COMPUTING THE LONGEST VIABLE PATH IN A COMBINATIONAL NETWORK [J]. 26TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, 1989, : 561 - 567
- [5] A nettree for simple paths with length constraint and the longest path in directed acyclic graphs [J]. Wu, Y.-X. (wuc567@163.com), 2012, Science Press (35):
- [10] SUBLINEAR LONGEST PATH TRANSVERSALS [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (03) : 1673 - 1677