The subgraph isomorphism problem for outerplanar graphs
- 31 December 1982
- journal article
- research article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 17 (1), 91-97
- https://doi.org/10.1016/0304-3975(82)90133-5
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Michael R. ΠGarey and David S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco1979, x + 338 pp.The Journal of Symbolic Logic, 1983
- Linear algorithms to recognize outerplanar and maximal outerplanar graphsInformation Processing Letters, 1979
- An Analysis of a Good Algorithm for the Subtree ProblemSIAM Journal on Computing, 1977
- Graphs with forbidden subgraphsJournal of Combinatorial Theory, Series B, 1971