Author:
Dessmark Anders,Lingas Andrzej,Garrido Oscar
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Takao Asano. Graphical Degree Sequence Problems with Connectivity Requirements. Proc. ISAAC'93, Hong Kong, Springer, LNCS 762, pp. 88–97.
2. B. Awerbuch, A. Israeli, Y. Shiloach. Finding Euler circuits in logarithmic parallel time. Proc. STOC, 1984, pp. 249–257.
3. C. Berge. Graphs and hypergraphs. North-Holland, American Elsevier, Amsterdam-London-New York (1973).
4. E. Cohen. Approximate max flow on small depth networks. Proc. 33rd FOCS, 1992, pp. 648–658.
5. R. Cole. Parallel merge sort. SIAM J. Computing, 17, (1988), pp. 770–785.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献