Subgraph isomorphism in graph classes

@article{Kijima2012SubgraphII,
  title={Subgraph isomorphism in graph classes},
  author={Shuji Kijima and Yota Otachi and Toshiki Saitoh and Takeaki Uno},
  journal={Discret. Math.},
  year={2012},
  volume={312},
  pages={3164-3173}
}
View via Publisher
doi.org
24 Citations
Highly Influential Citations
2
Background Citations
15
Results Citations
2

Figures from this paper

24 Citations

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs

Induced Subtrees in Interval Graphs

It is shown that the closely related Subtree Isomorphism problem is NP-complete even when G is restricted to the class of proper interval graphs, a well-known subclass of interval graphs.

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs

Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphsI

It is shown that even if the base graphs are somewhat restricted perfect graphs, the problem of finding a pattern graph that is a chain graph, a co-chain graph, or a threshold graph is NP-complete.

A NEW ALGORITHM FOR INDUCED SUBGRAPH ISOMORPHISM

A new algorithm for determining an induced subgraph isomorphism between pattern and target graphs is proposed, based on decomposition of a graph into components and refinements, which shows effectiveness after applying it on several types of graphs.

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs

This study proposes enumeration algorithms for intersection graph classes, which admit O( n )-bit string representations for their member graphs, and extends them to enumerate those with constraints on the maximum (bi)clique size and/or the number of edges.

Subgraph Isomorphism on Graph Classes that Exclude a Substructure

This work presents a near dichotomy of the complexity of Subgraph Isomorphism with respect to the forbidden minor, and shows fixed-parameter tractable cases and randomized XP-time solvable cases parameterized by the size of the forbiddenMinor.

On Tuza's conjecture in even co-chain graphs

In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoint triangles. This…

On Tuza's conjecture in co-chain graphs

In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoint triangles. This…

References

SHOWING 1-10 OF 32 REFERENCES

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs

It is shown that when G is an interval graph and H is a connected proper interval graph, the problem is solvable in polynomial time and fixed parameter tractable when parametrised by the number of connected components of H.

The subgraph isomorphism problem for outerplanar graphs

Cleaning Interval Graphs

The NP-hardness of the Induced Subgraph Isomorphism problem is shown, and fixed-parameter tractability of the problem with non-standard parameterization is proved, where the parameter is the difference |V(G)|−|V(H)|.

The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees

On the complexity of finding iso- and other morphisms for partial k-trees

On the restriction of some NP-complete graph problems to permutation graphs

Permutation graphs are known as a useful class of perfect graphs for which the NP-complete graph problems GRAPH k-COLORABILITY, PARTITION INTO CLIQUES, CLIQUE and INDEPENDENT SET (VERTEX COVER)…

A Linear Time Algorithm for Deciding Interval Graph Isomorphism

It is shown that for a somewhat larger class of graphs, namely the chordal graphs, isomorphism is as hard as for general graphs.

Complement reducible graphs

Finding Hamiltonian Circuits in Interval Graphs

  • J. Keil
  • Mathematics
    Inf. Process. Lett.
  • 1985

Bandwidth of Bipartite Permutation Graphs

Efficient algorithms for computing the bandwidth for three graph classes are presented and the former two improve the previously known upper bounds to optimal, and the last one improves recent result, and they give positive answers to some open problems.