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

DOI10.1016/0020-0190(79)90062-0MaRDI QIDQ1259541zbMATH OpenOpenAlexFDO

Authors E. J. Cockayne, Andrew Thomason, 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

depth first searchgraph algorithmoptimizationshortest pathtree communication network

Mathematics Subject Classification ID

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

Cites work

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

This page was built for publication: An algorithm for the most economic link addition in a tree communications network

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