Page d'accueilRecherchesPublicationsEnseignementsEncadrement de ThèsesCVCoordonnéesLiensA Polynomial Algorithm for Subisomorphism of Holey Plane Graphs
Proc. of 7th International Workshop on Mining and Learning with Graphs (MLG)
July 2009, Leuven, Belgium
July 2009, Leuven, Belgium
Links: 
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.
BibTex references
@InProceedings{DHJSS09b,
author = {Damiand, G. and De La Higuera, C. and Janodet, J.-C. and Samuel, E. and Solnon, C.},
title = {A Polynomial Algorithm for Subisomorphism of Holey Plane Graphs},
booktitle = {Proc. of 7th International Workshop on Mining and Learning with Graphs (MLG)},
month = {July},
year = {2009},
address = {Leuven, Belgium},
url = {https://dtai.cs.kuleuven.be/events/ilp-mlg-srl/USBStick/}
}
author = {Damiand, G. and De La Higuera, C. and Janodet, J.-C. and Samuel, E. and Solnon, C.},
title = {A Polynomial Algorithm for Subisomorphism of Holey Plane Graphs},
booktitle = {Proc. of 7th International Workshop on Mining and Learning with Graphs (MLG)},
month = {July},
year = {2009},
address = {Leuven, Belgium},
url = {https://dtai.cs.kuleuven.be/events/ilp-mlg-srl/USBStick/}
}
Image
[Retour]