Author:
Mehlhorn Kurt,Neumann Adrian,Schmidt Jens M.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference32 articles.
1. Alkassar, E., Böhme, S., Mehlhorn, K., Rizkallah, Ch.: A framework for the verification of certifying computations. J. Autom. Reason. 52(3), 241–273 (2014)
2. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)
3. Corcoran, J.N., Schneider, U., Schüttler, H.-B.: Perfect stochastic summation in high order feynman graph expansions. Int. J. Mod. Phys. C 17(11), 1527–1549 (2006)
4. Dehne, F., Langston, M., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: implementations and experiments. In: Parameterized and Exact Computation, pp. 13–24 (2006)
5. Dinits, E.A., Karzanov, A.V., Lomonosov, M.V.: On the structure of a family of minimal weighted cuts in graphs. In: Studies in Discrete Mathematics (in Russian), pp. 290–306 (1976)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献