- 期刊
On Fast Path-Finding Algorithms in AND-OR Graphs
摘要
We present a polynomial-time path-finding algorithm in AND-OR graphs Given p arcs and n nodes, the complexity of the algorithm is O(np), which is superior to the complexity of previously known algorithms.
延伸閱讀
- 謝逢鳴（2006）。Research on the Shortest Path Algorithm with Pre-processing〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2006.00272
- 黃俊穎（2013）。Low-complexity Data Hiding Algorithms with Graph-based Parity Check〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0020-1606201301335900
- 莊國賢（2010）。A hyper-heuristic algorithm for optimizing customized learning paths〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://doi.org/10.6837/NCNU.2010.00107
- Li, C. C. (2012). Algorithms for the Robust Facility Location Problems on Graphs [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2012.00237
- BHAGAVATHI, D., GURLA, H., OLARIU, S., SCHWING, J. L., & ZHANG, J. (1996). Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs. VLSI Design, 1996(), 33-40. https://doi.org/10.1155/1996/40175