REAL
MagyarClear Cookie - decide language by browser settings

Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels

Jansen, B.M.P. and Marx, Dániel (2015) Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM Press, New York, pp. 616-629. ISBN 978-1-61197-374-7

[img]
Preview
 Text
jansen_marx_soda2015_packing_u.pdf
Download (515kB) | Preview
Item Type: Book Section
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 18 Dec 2015 19:48
Last Modified: 18 Dec 2015 19:48
URI: http://real.mtak.hu/id/eprint/31190

Actions (login required)

Edit Item Edit Item
EPrints Logo
Repository of the Academy's Library is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.