The subgraph isomorphism problem for outerplanar graphs

Article Properties
Cite
SysŁ;o, Maciej M. “The Subgraph Isomorphism Problem for Outerplanar Graphs”. Theoretical Computer Science, vol. 17, no. 1, 1982, pp. 91-97, https://doi.org/10.1016/0304-3975(82)90133-5.
SysŁ;o, M. M. (1982). The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science, 17(1), 91-97. https://doi.org/10.1016/0304-3975(82)90133-5
SysŁ;o, Maciej M. “The Subgraph Isomorphism Problem for Outerplanar Graphs”. Theoretical Computer Science 17, no. 1 (1982): 91-97. https://doi.org/10.1016/0304-3975(82)90133-5.
SysŁ;o MM. The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science. 1982;17(1):91-7.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
Title Journal Journal Categories Citations Publication Date
Linear algorithms to recognize outerplanar and maximal outerplanar graphs Information Processing Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
48 1979
An Analysis of a Good Algorithm for the Subtree Problem SIAM Journal on Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
38 1977
Graphs with forbidden subgraphs Journal of Combinatorial Theory, Series B
  • Science: Mathematics
66 1971
Outerplanar graphs: characterizations, testing, coding and counting 1978
Outerplanar graphs and weak duals 1974
Refrences Analysis
The category Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods 2 is the most frequently represented among the references in this article. It primarily includes studies from SIAM Review and SIAM Journal on Computing. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
Computational complexity of k-block conjugacy Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2 2021
Mapping Induced Subgraph Isomorphism Problems to Ising Models and Its Evaluations by an Ising Machine IEICE Transactions on Information and Systems
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2021
Subgraph Detection for Average Detectability of LTI Systems IEEE Transactions on Network Science and Engineering 2020
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree

International Journal of Foundations of Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2020
Families of nested graphs with compatible symmetric-group actions Selecta Mathematica
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
3 2019
Citations Analysis
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 13 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled The NP-completeness column: an ongoing guide and was published in 1985. The most recent citation comes from a 2021 study titled Mapping Induced Subgraph Isomorphism Problems to Ising Models and Its Evaluations by an Ising Machine. This article reached its peak citation in 2021, with 2 citations. It has been cited in 15 different journals, 6% of which are open access. Among related journals, the Theoretical Computer Science cited this research the most, with 6 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year