Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees

DOI10.1007/3-540-61680-2_78zbMath1379.68255OpenAlexW2164383229MaRDI QIDQ4595511

Andrzej Proskurowski, Anders Dessmark, Andrzej Lingas

Publication date: 5 December 2017

Published in: Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61680-2_78

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 (3)

Maximum packing for biconnected outerplanar graphs ⋮ Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time ⋮ The edge-disjoint paths problem is NP-complete for series-parallel graphs

This page was built for publication: Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees