See Also
- Boxicity, a different way of measuring the complexity of an arbitrary graph in terms of interval graphs
- Tree-depth, a number that is bounded for a minor-closed graph family if and only if the family excludes a path
- Degeneracy, a measure of the sparsity of a graph that is at most equal to its path width
- Graph bandwidth, a different NP-complete optimization problem involving linear layouts of graphs
- Strahler number, a measure of the complexity of rooted trees defined similarly to pathwidth of unrooted trees
Read more about this topic: Path Decomposition
Famous quotes containing the word see:
“See, see where Christ’s blood streams in the firmament!
One drop would save my soul—half a drop! ah, my Christ!—
Ah, rend not my heart for naming of my Christ!—
Yet will I call on him!—O, spare me, Lucifer!—
Where is it now? ‘T is gone; and see where God
Stretcheth out his arm, and bends his ireful brows!—
Mountains and hills, come, come and fall on me,
And hide me from the heavy wrath of God!”
—Christopher Marlowe (1564–1593)