Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width

DOI10.1007/3-540-60922-9_37zbMath1379.68164OpenAlexW1544045550MaRDI QIDQ4593952

Naomi Nishimura, Arvind Kumar Gupta

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_37

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Maximum packing for biconnected outerplanar graphs ⋮ Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time

This page was built for publication: Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width