Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)

Marx, Dániel and Pilipczuk, Michal (2014) Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, 25. pp. 542-553. ISSN 1868-8969 10.4230/LIPIcs.STACS.2014.542

[img]
Preview
Text
Marx_542_2794539_ny.pdf

Download (696kB) | Preview
Item Type: Article
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: 12 Feb 2015 19:28
Last Modified: 12 Feb 2015 19:28
URI: http://eprints.sztaki.hu/id/eprint/8210

Update Item Update Item