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

Centro de Investigación en Computación (CIC)

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

3 Citas (Scopus)

Resumen

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.

Idioma original	Inglés
Páginas (desde-hasta)	170-175
Número de páginas	6
Publicación	Unknown Journal
Estado	Publicada - 2001

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

@article{1bdb153df48a46c5a54ff85d39fe5b7f,

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 = "Ingl{\'e}s",

pages = "170--175",

journal = "Unknown Journal",

}

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 - http://www.scopus.com/inward/record.url?scp=4944221132&partnerID=8YFLogxK

M3 - Artículo

AN - SCOPUS:4944221132

SP - 170

EP - 175

JO - Unknown Journal

JF - Unknown Journal

ER -

A fast scheduling algorithm in AND-OR graphs

Resumen

Otros archivos y enlaces

Huella

Citar esto