On the rearrangeability of multistage networks employing uniform connection pattern

Simple item page
dc.contributor.authorBashirov, R
dc.date.accessioned2026-02-06T18:16:52Z
dc.date.issued2000
dc.departmentDoğu Akdeniz Üniversitesi
dc.description1st International Conference on Advances in Information Systems (ADVIS 2000) -- OCT 25-27, 2000 -- IZMIR, TURKEY
dc.description.abstractIn this paper, the rearrangeability of (2s -1)-stage networks is proved. This result is used to prove that (2 log(n)N-1)-stage nonsymmetric networks employing uniform connection pattern, two passes through s-stage networks with the same kth and (s-k+1)st stages, and 2 log(n)N-1 circulations through single-stage networks are rearrangeable.
dc.description.sponsorshipDokuz Eylul Univ Izmir, Comp Engn Dept
dc.identifier.endpage179
dc.identifier.isbn3-540-41184-4
dc.identifier.issn0302-9743
dc.identifier.orcid0000-0002-9037-6225
dc.identifier.scopus2-s2.0-33646948060
dc.identifier.scopusqualityQ3
dc.identifier.startpage170
dc.identifier.urihttps://hdl.handle.net/11129/8689
dc.identifier.volume1909
dc.identifier.wosWOS:000174113300016
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer-Verlag Berlin
dc.relation.ispartofAdvances in Information Systems, Proceedings
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectExchange
dc.titleOn the rearrangeability of multistage networks employing uniform connection pattern
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu