On the ordered list subgraph embedding problems
From MaRDI portal
Publication:270006
DOI10.1007/s00453-015-9980-2zbMath1332.68076arXiv1403.2009MaRDI QIDQ270006
Olawale Hassan, Daniel Lokshtanov, Ljubomir Perković, Iyad A. Kanj
Publication date: 6 April 2016
Published in: Algorithmica, Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.2009
approximation; graph algorithms; (classical) complexity; ordered subgraph embedding; parametrized complexity; protein/DNA structural comparison
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)