Lower bounds on communication overlap of networks

DOI10.1016/0304-3975(86)90156-8zbMath0632.68061OpenAlexW2051733977MaRDI QIDQ1095665

B. George

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90156-8

zbMATH Keywords

interconnection networkcommunication overlap

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

The minumum geodetic communication overlap graphs

Cites Work

• On sparse graphs with dense long paths
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds on communication overlap of networks