Linear election in pancake graphs-Reference-Cited by-同舟云学术

Linear election in pancake graphs

Published:2008-04 Issue:3 Volume:106 Page:127-131
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Mohamed Adnan,Ramakrishna R.S.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference7 articles.

1. A group theoretic model for symmetric interconnection networks;Akers;IEEE Transactions on Computers,1989

2. R. Bagnara, A. Zaccagnini, Checking and bounding the solutions of some recurrence relations, Technical Report, Quaderno 344, Department of Mathematics, University of Parma, Italy, 2004

3. A modular technique for the design of efficient leader algorithms;Korach;ACM Trans. Programming Languages and Systems,1990

4. Distributed match-making;Mullender;Algorithmica,1988

5. G. Tel, Linear election for oriented hypercubes, Technical report TR-RUU-CS-93-39, Department of Computer Science, Utrecht University, The Netherlands, 1993

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs;International Journal of Computer Mathematics: Computer Systems Theory;2022-09-07

2. Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract);Lecture Notes in Computer Science;2021

3. Fractional Matching Preclusion for (Burnt) Pancake Graphs;2018 15th International Symposium on Pervasive Systems, Algorithms and Networks (I-SPAN);2018-10

4. Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs;International Journal of Parallel, Emergent and Distributed Systems;2013-10-09

5. STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS;Journal of Interconnection Networks;2013-06