A note on practical construction of maximum bandwidth paths.

DOI10.1016/S0020-0190(01)00323-4zbMath1043.68008MaRDI QIDQ1853065

Navneet Malpani, Jian'er Chen

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Dijkstra's algorithmKruskal's algorithmNetwork routing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (3)

Wireless sensor networks scheduling for full angle coverage ⋮ Finding optimal paths in MREP routing ⋮ Sorting can exponentially speed up pure dynamic programming

Cites Work

• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on practical construction of maximum bandwidth paths.