 |
Université Jean Monnet – Saint-Etienne |  |
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.
Cited literature [8 references]
https://hal-ujm.archives-ouvertes.fr/ujm-00411610
Contributor : Émilie Samuel <>
Submitted on : Thursday, June 9, 2011 - 1:23:54 PM
Last modification on : Tuesday, June 2, 2020 - 9:56:18 AM
Document(s) archivé(s) le : Saturday, September 10, 2011 - 2:20:13 AM
Contributor : Émilie Samuel <>
Submitted on : Thursday, June 9, 2011 - 1:23:54 PM
Last modification on : Tuesday, June 2, 2020 - 9:56:18 AM
Document(s) archivé(s) le : Saturday, September 10, 2011 - 2:20:13 AM
File
conf-2009-mlg.pdf
Files produced by the author(s)
