Lower bounds on communication overlap of networks
From MaRDI portal
Publication:1095665
DOI10.1016/0304-3975(86)90156-8zbMath0632.68061MaRDI QIDQ1095665
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
94C15: Applications of graph theory to circuits and networks