A fast scheduling algorithm in AND-OR graphs

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

A fast scheduling algorithm in AND-OR graphs

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

Bar-Ilan University
Instituto Politécnico Nacional
Holon Institute of Technology

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

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 language	English
Pages (from-to)	170-175
Number of pages	6
Journal	Topics in Applied and Theoretical Mathematics and Computer Science
State	Published - 2001
Externally published	Yes

Keywords

AND-OR graphs
Polynomial-time algorithms
Routing
Scheduling

Cite this

@article{8002e5a3a6c6401f8444ffbaf82ba344,

title = "A fast scheduling algorithm in AND-OR graphs",

abstract = "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.",

keywords = "AND-OR graphs, Polynomial-time algorithms, Routing, Scheduling",

author = "Adelson-Velsky, \{George M.\} and Alexander Gelbukh and Eugene Levner",

year = "2001",

language = "אנגלית",

pages = "170--175",

journal = "Topics in Applied and Theoretical Mathematics and Computer Science",

}

TY - JOUR

T1 - A fast scheduling algorithm in AND-OR graphs

AU - Adelson-Velsky, George M.

AU - Gelbukh, Alexander

AU - Levner, Eugene

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - AND-OR graphs

KW - Polynomial-time algorithms

KW - Routing

KW - Scheduling

UR - https://www.scopus.com/pages/publications/4944221132

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:4944221132

SP - 170

EP - 175

JO - Topics in Applied and Theoretical Mathematics and Computer Science

JF - Topics in Applied and Theoretical Mathematics and Computer Science

ER -

A fast scheduling algorithm in AND-OR graphs

Abstract

Keywords

Other files and links

Fingerprint

Cite this