The Design of Small-Diameter Networks by Local Search

DOI10.1109/TC.1979.1675402MaRDI QIDQ4198640zbMATH OpenOpenAlexFDO

Authors Sam Toueg, Ken Steiglitz

Publication date 1979

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1979.1675402

zbMATH Keywords

communication networkslocal search algorithmdesign of small-diameter networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05) Discrete mathematics in relation to computer science (68R99) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Computational and Information Science
• scientific article; zbMATH DE number 1107739
• Connectivity of Regular Directed Graphs with Small Diameters
• scientific article; zbMATH DE number 3950393
• New results for the degree/diameter problem

Cited in

(7)

• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• On Local Search and Placement of Meters in Networks
• A knowledge-based approach to the local area network design problem
• scientific article; zbMATH DE number 3950393 (Why is no real title available?)
• Small-diameter system area network composed of small-port routers
• Content search through comparisons
• High density graphs for processor interconnection

This page was built for publication: The Design of Small-Diameter Networks by Local Search

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