| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428475 | Information Processing Letters | 2016 | 5 Pages |
Abstract
•Subgraph Isomorphism is studied on graph classes.•A polynomial-time algorithm is given for an open case in the literature.•Base graphs are bipartite permutation graphs and pattern graphs are chain graphs.
We present a polynomial-time algorithm for solving Subgraph Isomorphism where the base graphs are bipartite permutation graphs and the pattern graphs are chain graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Masashi Kiyomi, Yota Otachi,