Induced subgraph isomorphism on proper interval and bipartite permutation graphs

DOI10.1016/j.tcs.2014.10.002zbMath1303.68060MaRDI QIDQ476868

Pinar Heggernes, Daniel Meister, Yngve Villanger, Pim van 't Hof

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.002

zbMATH Keywords

induced subgraphs; isomorphism; polynomial-time; fixed-parameter tractable

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)