Parameterized complexity of asynchronous border minimization

DOI10.1007/978-3-319-17142-5_36MaRDI QIDQ6827734zbMATH OpenFDO

Authors Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa

Publication date 30 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Parameterized complexity of asynchronous border minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827734)