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

Jansen, BMP 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (8845). Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp. 616-629. ISBN 978-1-61197-374-7

[img]
Preview
Text
Jansen_616_2983454_ny.pdf

Download (515kB) | Preview
[img] Text
Jansen_616_2983454_z.pdf
Restricted to Registered users only

Download (473kB) | Request a copy
Item Type: Book Section
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 05 Feb 2016 18:27
Last Modified: 05 Feb 2016 18:27
URI: http://eprints.sztaki.hu/id/eprint/8574

Update Item Update Item