Author:
Kiviluoto Lasse,Östergård Patric R. J.,Vaskelainen Vesa P.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference31 articles.
1. Alon N (1998) On the capacity of digraphs. Eur J Combin 19:1–5
2. Bang-Jensen J, Gutin G (2001) Digraphs: theory, algorithms and applications. Springer, London
3. Berghammer R, Fronk A (2006) Exact computation of minimum feedback vertex sets with relational algebra. Fund Inform 70:301–316
4. Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization, supplement vol A. Kluwer, Dordrecht, pp 1–74
5. Brazdil PB, Soares C (2000) A comparison of ranking methods for classification algorithm selection. In: López de Mántanas R, Plaza E (eds) Machine learning: ECML 2000, LNCS vol 1810. Springer, Berlin, pp 63–74
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Ramsey Theory;2018-08-06