On the Optimal Solutions to AND/OR Series-Parallel Graphs
From MaRDI portal
Publication:5627926
DOI10.1145/321650.321653zbMath0222.90044OpenAlexW2021686582MaRDI QIDQ5627926
Richard Chia-Tung Lee, Richard M. Simon
Publication date: 1971
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321650.321653
Programming involving graphs or networks (90C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
And/or-convexity: a graph convexity based on processes and deadlock models, Tractability, hardness, and kernelization lower bound for and/or graph solution, Revisiting the complexity of and/or graph solution