Special Classes of Graphs
The longest path problem may be solved in polynomial time on the complements of comparability graphs. It may also be solved in polynomial time on any class of graphs with bounded treewidth or bounded clique-width, such as the distance-hereditary graphs. However, it is NP-hard even when restricted to split graphs, circle graphs, or planar graphs.
Read more about this topic: Longest Path Problem
Famous quotes containing the words special and/or classes:
“The gap between ideals and actualities, between dreams and achievements, the gap that can spur strong men to increased exertions, but can break the spirit of others—this gap is the most conspicuous, continuous land mark in American history. It is conspicuous and continuous not because Americans achieve little, but because they dream grandly. The gap is a standing reproach to Americans; but it marks them off as a special and singularly admirable community among the world’s peoples.”
—George F. Will (b. 1941)
“Is a man too strong and fierce for society, and by temper and position a bad citizen,—a morose ruffian, with a dash of the pirate in him;Mnature sends him a troop of pretty sons and daughters, who are getting along in the dame’s classes at the village school, and love and fear for them smooths his grim scowl to courtesy. Thus she contrives to intenerate the granite and the feldspar, takes the boar out and puts the lamb in, and keeps her balance true.”
—Ralph Waldo Emerson (1803–1882)