Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees

DOI10.1007/s004530010023zbMath0960.05098OpenAlexW2164155173MaRDI QIDQ1578418

Andrzej Lingas, Andrzej Proskurowski, Anders Dessmark

Publication date: 27 August 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010023

zbMATH Keywords

treewidthsubgraph isomorphismpartial \(k\)-trees

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth ⋮ A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree ⋮ Embeddings of \(k\)-connected graphs of pathwidth \(k\) ⋮ Unnamed Item ⋮ An algebraic view of the relation between largest common subtrees and smallest common supertrees

This page was built for publication: Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees