scientific article; zbMATH DE number 3963193

MaRDI QIDQ3731030zbMATH OpenFDO

Authors Andrzej Lingas

Publication date 1986

zbMATH Keywords

biconnectivitydynamic programming algorithmouterplanaritypolynomial-time upper bound

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Subgraph Isomorphism in Planar Graphs and Related Problems
• scientific article; zbMATH DE number 4072379
• A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree
• Planar subgraph isomorphism revisited
• Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees

Cited in

(7)

• Subgraph isomorphism for biconnected outerplanar graphs in cubic time
• Maximum packing for biconnected outerplanar graphs
• scientific article; zbMATH DE number 4043266 (Why is no real title available?)
• scientific article; zbMATH DE number 4072379 (Why is no real title available?)
• Subgraph Isomorphism in Planar Graphs and Related Problems
• scientific article; zbMATH DE number 1542609 (Why is no real title available?)
• Subgraph isomorphism in graph classes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731030)