Lesson plan
Cutwidth
In graph theory, the cutwidth of an undirected graph is the smallest integer k with the following property: there is an ordering of the vertices of the graph, such that every cut obtained by partitioning the vertices into earlier and later subsets of the ordering is crossed by at most k edges. That is, if the vertices are numbered v_1,v_2,\dots v_n , then for every \ell=1,2,\dots n-1 , the number of edges v_iv_j with i\le\ell and j>\ell is at most k . The cutwidth of a graph has also been called its folding number. Both the vertex ordering that produces the cutwidth, and the problem of computing this ordering and the cutwidth, have been called minimum cut linear arrangement.
Article summary
In graph theory, the cutwidth of an undirected graph is the smallest integer k with the following property: there is an ordering of the vertices of the graph, such that every cut obtained by partitioning the vertices into earlier and later subsets of the ordering is crossed by at most k edges. That is, if the vertices are numbered v_1,v_2,\dots v_n , then for every \ell=1,2,\dots n-1 , the number of edges v_iv_j with i\le\ell and j>\ell is at most k . The cutwidth of a graph has also been called its folding number. Both the vertex ordering that produces the cutwidth, and the problem of computing this ordering and the cutwidth, have been called minimum cut linear arrangement.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.