IT-DI-2002-0002

"A New Algorithm for Mapping DAGs to Series-Parallel Form"

Arturo González Escribano, Arjan J. C. van Gemund, Valentín Cardeñoso Payo

Informe técnico: IT-DI-2002-0002

Documento completo: Formato pdf Pdf (331 Kb) .

Resumen: This report presents a new algorithm technique that transforms DAGs (Direct Acyclic Graphs) into SP (Series-Parallel) form. The complexity bounds are O(m+n) in space and O(m+n log n) in time.

Referencia bibliográfica (formato BibTeX)
@TECHREPORT { IT-DI-2002-0002,
    author = { Arturo González Escribano and Arjan J. C. van Gemund and Valentín Cardeñoso Payo },
    title = { A New Algorithm for Mapping DAGs to Series-Parallel Form },
    number = { IT-DI-2002-0002 },
    year = { 2002 },
    institution = { Dep. Informatica, Universidad de Valladolid }
}

This website stores cookies on your computer. These cookies are used to provide a more personalized experience and to track your whereabouts around our website in compliance with the European General Data Protection Regulation. If you decide to to opt-out of any future tracking, a cookie will be setup in your browser to remember this choice for one year.

Accept or Deny

Translate »
error: Este contenido está protegido por CopyRight !!