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)
“People generally will soon understand that writers should be judged, not according to rules and species, which are contrary to nature and art, but according to the immutable principles of the art of composition, and the special laws of their individual temperaments.”
—Victor Hugo (1802–1885)
“Medication alone is not to be relied on. In one half the cases medicine is not needed, or is worse than useless. Obedience to spiritual and physical laws—hygeine [sic] of the body, and hygeine of the spirit—is the surest warrant for health and happiness.”
—Harriot K. Hunt (1805–1875)