An algorithm for the most economic link addition in a tree communications network

DOI10.1016/0020-0190(79)90062-0zbMath0411.94019OpenAlexW2008994387MaRDI QIDQ1259541

Andrew G. Thomason, E. J. Cockayne, Frank Ruskey

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90062-0

zbMATH Keywords

optimizationshortest pathgraph algorithmdepth first searchtree communication network

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cites Work

• A method and two algorithms on the theory of partitions
• Linear algorithms on recursive representations of trees
• Optimum Communication Spanning Trees
• Optimum addition of an edge to a path