A Subexponential Algorithm for Trivalent Graph IsomorphismJune 1980
- Authors:
- Merrick Furst,
- John E. Hopcroft,
- Eugene Luks
Skip Abstract Section
Abstract
NO ABSTRACT SUPPLIED
Recommendations
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs
Given two graphs, Subgraph Isomorphism is the problem of deciding whether the first graph (the base graph) contains a subgraph isomorphic to the second one (the pattern graph). This problem is NP-complete even for very restricted graph classes such as ...
Exploring the Subexponential Complexity of Completion Problems
Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a graph from F as an induced subgraph. ...