Solved Special Cases
A number of important special cases of the graph isomorphism problem have efficient, polynomial-time solutions:
- Trees
- Planar graphs (In fact, planar graph isomorphism is in log space, a class contained in P.)
- Interval graphs
- Permutation graphs
- Partial k-trees
- Bounded-parameter graphs
- Graphs of bounded genus (Note: planar graphs are graphs of genus 0)
- Graphs of bounded degree
- Graphs with bounded eigenvalue multiplicity
- k-Contractible graphs (a generalization of bounded degree and bounded genus)
- Color-preserving isomorphism of colored graphs with bounded color multiplicity (i.e., at most k vertices have the same color for a fixed k) is in class NC, which is a subclass of P.
Read more about this topic: Graph Isomorphism Problem
Famous quotes containing the words solved, special and/or cases:
“[In government] the problem to be solved is, not what form of government is perfect, but which of the forms is least imperfect.”
—James Madison (1751–1836)
“It is a maxim among these lawyers, that whatever hath been done before, may legally be done again: and therefore they take special care to record all the decisions formerly made against common justice and the general reason of mankind.”
—Jonathan Swift (1667–1745)
“In cases of defense ‘tis best to weigh
The enemy more mighty than he seems.”
—William Shakespeare (1564–1616)