A fast scheduling algorithm in AND-OR graphs

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

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We present a polynomial-time algorithm for scheduling tasks in AND-OR graphs. Given the number p of arcs and n of nodes, the complexity of the algorithm is O(np), which is superior to the complexity of previously known algorithms.

Original languageEnglish
Pages (from-to)170-175
Number of pages6
JournalUnknown Journal
StatePublished - 2001
Externally publishedYes


  • AND-OR graphs
  • Polynomial-time algorithms
  • Routing
  • Scheduling


Dive into the research topics of 'A fast scheduling algorithm in AND-OR graphs'. Together they form a unique fingerprint.

Cite this