Author:
Dessmark Anders,Garrido Oscar,Lingas Andrzej
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference14 articles.
1. S.R. Arikati, A. Maheshwari, Realizing degree sequences in parallel, in: Proc. 5th ISAAC'94, Lecture Notes in Computer Science, vol. 834, Springer, Berlin, pp. 261–269; to appear in: SIAM J. Discrete Math.
2. T. Asano, Graphical degree sequence problems with connectivity requirements, in: Proc. ISAAC'93, Hong Kong, Lecture Notes in Computer Science, vol. 762, Springer, Berlin, pp. 88–97.
3. Graphs and Hypergraphs;Berge,1973
4. Parallel merge sort;Cole;SIAM J. Comput.,1988
5. On the parallel complexity of maximum f-matching and the degree sequence problem;Dessmark,1994
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Distributed backup placement in networks;Distributed Computing;2017-06-03
2. Distributed Backup Placement in Networks;Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures;2015-06-13