Polynomial algorithms for open plane graph and subgraph isomorphisms
- 1 August 2013
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 498, 76-99
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Polynomial algorithms for subisomorphism of nD open combinatorial mapsComputer Vision and Image Understanding, 2011
- A parametric filtering algorithm for the graph isomorphism problemConstraints, 2008
- THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- A large database of graphs and its use for benchmarking graph isomorphism algorithmsPattern Recognition Letters, 2003
- Optimal quadratic-time isomorphism of ordered graphsPattern Recognition, 1999
- Subgraph Isomorphism in Planar Graphs and Related ProblemsJournal of Graph Algorithms and Applications, 1999
- The minimum broadcast time problem for several processor networksTheoretical Computer Science, 1995
- N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDSInternational Journal of Computational Geometry & Applications, 1994
- Linear Algorithms for Isomorphism of Maximal Outerplanar GraphsJournal of the ACM, 1979