Subgraph homeomorphism via the edge addition planarity algorithm

DOI10.7155/JGAA.00268MaRDI QIDQ3143746zbMATH OpenOpenAlexFDO

Authors John M. Boyer

Publication date 4 December 2012

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00268

zbMATH Keywords

path traversal processplanar embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An approach to the subgraph homeomorphism problem
• scientific article; zbMATH DE number 140477
• O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
• The subgraph homeomorphism problem
• Searching forK_3,3in linear time

Cited in

(1)

• Revising the Fellows-Kaschube \(K_{3,3}\) search

This page was built for publication: Subgraph homeomorphism via the edge addition planarity algorithm

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