The Design of Small-Diameter Networks by Local Search

DOI10.1109/TC.1979.1675402zbMATH Open0409.94037OpenAlexW1896114218MaRDI QIDQ4198640FDOQ4198640

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

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

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)

Cited In (7)

• Title not available (Why is that?)
• On Local Search and Placement of Meters in Networks
• High density graphs for processor interconnection
• Title not available (Why is that?)
• Content search through comparisons
• A knowledge-based approach to the local area network design problem
• Small-diameter system area network composed of small-port routers

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)