Permutation routing and ( , k)-routing on plane grids

DOI10.1007/978-3-642-02250-0_10MaRDI QIDQ3404473zbMATH OpenOpenAlexFDO

Authors Ignasi Sau, Janez Žerovnik

Publication date 9 February 2010

Published in Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02250-0_10

zbMATH Keywords

shortest pathdistributed algorithmpacket routingplane grids

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Packet Routing on grids of processors
• Publication:3484352
• Packet Routing on the Grid
• An optimal permutation routing algorithm on full-duplex hexagonal networks
• Routing on trees

Cited in

(3)

• Routing permutations on graphs via factors
• A \(d\)-move local permutation routing for the \(d\)-cube
• An optimal permutation routing algorithm on full-duplex hexagonal networks

This page was built for publication: Permutation routing and \((\ell , k)\)-routing on plane grids

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