Skip to Main content Skip to Navigation
Conference papers

A Polynomial Algorithm for Subisomorphism of Open Plane Graphs

Abstract : We address the problem of searching for a pattern in a plane graph, that is, a planar drawing of a planar graph. We define plane subgraph isomorphism and give a polynomial algorithm for this problem. We show that this algorithm may be used even when the pattern graph has holes.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Émilie Samuel Connect in order to contact the contributor
Submitted on : Thursday, June 9, 2011 - 1:23:54 PM
Last modification on : Saturday, June 25, 2022 - 7:25:31 PM
Long-term archiving on: : Saturday, September 10, 2011 - 2:20:13 AM


Files produced by the author(s)


  • HAL Id : ujm-00411610, version 1


Guillaume Damiand, Colin de La Higuera, Jean-Christophe Janodet, Émilie Samuel, Christine Solnon. A Polynomial Algorithm for Subisomorphism of Open Plane Graphs. Mining and Learning with Graphs (MLG), Jul 2009, Leuven, Belgium. pp.mlg09-11. ⟨ujm-00411610⟩



Record views


Files downloads