共 50 条
- [32] A heuristic method for constructing hexagonal Steiner minimal trees for routing in VLSI 2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS, 2006, : 1788 - +
- [33] An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks Telecommunication Systems, 2016, 62 : 327 - 346
- [34] Constructing minimal spanning trees with lower and upper bounded path delays ISCAS 96: 1996 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - CIRCUITS AND SYSTEMS CONNECTING THE WORLD, VOL 4, 1996, : 416 - 419
- [38] Minimal cut set/sequence generation for dynamic fault trees ANNUAL RELIABILITY AND MAINTAINABILITY SYMPOSIUM, 2004 PROCEEDINGS, 2004, : 207 - 213