On fast path-finding algorithms in AND-OR graphs

DOI10.1080/10241230306728zbMath1069.90103OpenAlexW2020512977WikidataQ57556170 ScholiaQ57556170MaRDI QIDQ1886199

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

Publication date: 16 November 2004

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10241230306728

zbMATH Keywords

RoutingSchedulingPolynomial-time algorithmsAND-OR graphsExtremal paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Minimal functional routes in directed graphs with dependent edges

This page was built for publication: On fast path-finding algorithms in AND-OR graphs