On fast path-finding algorithms in AND-OR graphs

George M. Adelson-Velsky; Alexander Gelbukh; Eugene Levner

首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >On fast path-finding algorithms in AND-OR graphs

【24h】

On fast path-finding algorithms in AND-OR graphs

机译：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.

著录项

来源
《Mathematical Problems in Engineering: Theory, Methods and Applications》 |2002年第5期|283-293|共11页
作者
George M. Adelson-Velsky; Alexander Gelbukh; Eugene Levner;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种英语
中图分类工程数学;
关键词
AND-OR graphs; Extremal paths; Scheduling; Routing; Polynomial-time algorithms;

客服邮箱：kefu@zhangqiaokeyan.com

客服微信
服务号

On fast path-finding algorithms in AND-OR graphs

摘要

著录项

相关主题

期刊订阅