LATIN 2004: Theoretical Informatics
From MaRDI portal
Publication:5901677
DOI10.1007/b95852zbMath1196.68175OpenAlexW2475444492MaRDI QIDQ5901677
Bernard Mans, Igor E. Shparlinski
Publication date: 7 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95852
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Forwarding and optical indices of 4-regular circulant networks ⋮ Random walks, bisections and gossiping in circulant graphs ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Unnamed Item ⋮ A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS
This page was built for publication: LATIN 2004: Theoretical Informatics
