scientific article; zbMATH DE number 1305499

MaRDI QIDQ4252389zbMATH OpenFDO

Authors Pierre Fraigniaud, Johanne Cohen, M. Mitjana

Publication date 1999

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Cited in

(1)

• A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252389)