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:
“To see ourselves as others see us can be eye-opening. To see others as sharing a nature with ourselves is the merest decency. But it is from the far more difficult achievement of seeing ourselves amongst others, as a local example of the forms human life has locally taken, a case among cases, a world among worlds, that the largeness of mind, without which objectivity is self- congratulation and tolerance a sham, comes.”
—Clifford Geertz (b. 1926)