共 50 条
- [43] PROCESSOR EFFICIENT PARALLEL ALGORITHMS FOR THE 2 DISJOINT PATHS PROBLEM, AND FOR FINDING A KURATOWSKI HOMEOMORPH [J]. 30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 300 - 305
- [45] A DATA STRUCTURE USEFUL FOR FINDING HAMILTONIAN CYCLES [J]. THEORETICAL COMPUTER SCIENCE, 1990, 71 (03) : 419 - 424
- [48] Finding the k shortest paths in parallel [J]. STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 475 - 486
- [49] FINDING HAMILTONIAN CYCLES IN CERTAIN PLANAR GRAPHS [J]. INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 249 - 254