Author:
Berghammer Rudolf,Kulczynski Mitja
Publisher
Springer International Publishing
Reference16 articles.
1. Berge, C., Duchet, P.: Recent problems and results aboutkernels in directed graphs. Disc. Math. 86, 27–31 (1990)
2. Berghammer, R., Hoffmann, T.: Deriving relational programs for computing kernels by reconstructing a proof of Richardson’s theorem. Sci. Comput. Program. 38, 1–25 (2000)
3. Lecture Notes in Computer Science;R Berghammer,2002
4. Lecture Notes in Computer Science;R Berghammer,2005
5. Chvatal, V.: On the computational complexity of finding a kernel. Technical report CRM-300, Centre de Recherche Mathématiques, Université de Montréal (1973)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献