On the complexity of some arborescences finding problems on a multishop radio network

DOI10.1007/BF01952676MaRDI QIDQ1123615zbMATH OpenOpenAlexFDO

Authors Nen-Fu Huang, Tsing-Her Huang

Publication date 1989

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01952676

zbMATH Keywords

arborescencesminimum spanning treesNP-completenessradio networks

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1330076
• scientific article; zbMATH DE number 7692724
• Polynomial-time algorithms for minimum-time broadcast in trees
• Models and heuristics for a minimum arborescence problem
• A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

Cites work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A note on finding optimum branchings
• Finding optimum branchings
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3285076 (Why is no real title available?)

This page was built for publication: On the complexity of some arborescences finding problems on a multishop radio network

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