Abstract
The sorting number of a graph with n vertices is the minimum depth of a sorting network with n inputs and n outputs that uses only the edges of the graph to perform comparisons. Many known results on sorting networks can be stated in terms of sorting numbers of different classes of graphs. In this paper we show the following general results about the sorting number of graphs.
-
1.
Any n-vertex graph that contains a simple path of length d has a sorting network of depth \(O(n \log (n/d))\).
-
2.
Any n-vertex graph with maximal degree \(\varDelta \) has a sorting network of depth \(O(\varDelta n)\).
We also provide several results relating the sorting number of a graph with its routing number, size of its maximum matching, and other well known graph properties. Additionally, we give some new bounds on the sorting number for some typical graphs.
The first author was partially supported by DTIC Contract FA8075-14-D-0002/0007.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A mapping \(f :V \rightarrow V\) is an automorphism of \(G = (V,E)\) if for all \(v_1,v_2 \in V\) it holds that \((v_1,v_2) \in E \Leftrightarrow (f(v_1),f(v_2) ) \in E\).
References
Ajtai, M., Komlós, J., Szemerédi, E.: An \(O(n log n)\) sorting network. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 1–9. ACM (1983)
Alon, N., Chung, F.R., Graham, R.L.: Routing permutations on graphs via matchings. SIAM J. Discrete Math. 7(3), 513–530 (1994)
Angel, O., Shinkar, I.: A tight upper bound on acquaintance time of graphs. Graphs Comb. 32(5), 1667–1673 (2016). arXiv:1307.6029
Babai, L., Szegedy, M.: Local expansion of symmetrical graphs. Comb. Probab. Comput. 1(01), 1–11 (1992)
Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the 30 April–2 May 1968, Spring Joint Computer Conference, pp. 307–314. ACM (1968)
Benjamini, I., Shinkar, I., Tsur, G.: Acquaintance time of a graph. SIAM J. Discrete Math. 28(2), 767–785 (2014)
Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)
Kunde, M.: Optimal sorting on multi-dimensionally mesh-connected computers. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol. 247, pp. 408–419. Springer, Heidelberg (1987). https://doi.org/10.1007/BFb0039623
Leighton, T., Plaxton, C.G.: Hypercubic sorting networks. SIAM J. Comput. 27(1), 1–47 (1998)
Plaxton, C.G., Suel, T.: A super-logarithmic lower bound for hypercubic sorting networks. In: Abiteboul, S., Shamir, E. (eds.) ICALP 1994. LNCS, vol. 820, pp. 618–629. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58201-0_103
Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh connected computers. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 255–263. ACM (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Banerjee, I., Richards, D., Shinkar, I. (2019). Sorting Networks on Restricted Topologies. In: Catania, B., Královič, R., Nawrocki, J., Pighizzini, G. (eds) SOFSEM 2019: Theory and Practice of Computer Science. SOFSEM 2019. Lecture Notes in Computer Science(), vol 11376. Springer, Cham. https://doi.org/10.1007/978-3-030-10801-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-10801-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-10800-7
Online ISBN: 978-3-030-10801-4
eBook Packages: Computer ScienceComputer Science (R0)