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:
“Nothing in the world can take the place of Persistence. Talent will not; nothing is more common than unsuccessful men with talent. Genius will not; unrewarded genius is almost a proverb. Education will not; the world is full of educated derelicts. Persistence and Determination alone are omnipotent. The slogan “Press On”, has solved and will always solve the problems of the human race.”
—Calvin Coolidge (1872–1933)
“In this century the writer has carried on a conversation with madness. We might almost say of the twentieth-century writer that he aspires to madness. Some have made it, of course, and they hold special places in our regard. To a writer, madness is a final distillation of self, a final editing down. It’s the drowning out of false voices.”
—Don Delillo (b. 1926)
“... in all cases of monstrosity at birth anaesthetics should be applied by doctors publicly appointed for that purpose... Every successive year would see fewer of the unfit born, and finally none. But, it may be urged, this is legalized infanticide. Assuredly it is; and it is urgently needed.”
—Tennessee Claflin (1846–1923)