Author:
Klein Philip,Stein Clifford
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. N. Alon and M. Tarsi. Covering multigraphs by simple circuits.SIAM J. Algebraic Discrete Methods,6:345?350, 1985.
2. B. Awerbach, A. Israeli, and Y. Shiloach. Finding Euler circuits in logarithmic parallel time. InProceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 249?257.
3. C. Berge.Graphs and Hypergraphs. North-Holland, Amsterdam, 1979.
4. R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. InProceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 478?491.
5. H. Cross. Analysis of flow in networks of conduits of conductors. Bulletin 286, University of Illinois Engineering Experimental Station, Urbana, Illinois, 1936.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献