cutwidth

The minimum number of edges that cross any cut between lower-numbered and higher-numbered vertices in an optimal linear arrangement of the vertices of a graph.

Noun

  1. The minimum number of edges that cross any cut between lower-numbered and higher-numbered vertices in an optimal linear arrangement of the vertices of a graph.

Origin

From cut + width.

Forms

cutwidths

Related

pathwidth