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

DOI10.1007/BF01952676zbMath0677.68044OpenAlexW2011400984MaRDI QIDQ1123615

Tsing-Her Huang, Nen-Fu 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

NP-completenessminimum spanning treesarborescencesradio networks

Mathematics Subject Classification ID

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

Cites Work

• A note on finding optimum branchings
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Finding optimum branchings
• Unnamed Item
• Unnamed Item

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