Pages that link to "Item:Q3771641"
From MaRDI portal
The following pages link to A polynomial algorithm for the min-cut linear arrangement of trees (Q3771641):
Displayed 28 items.
- A degree sequence method for the cutwidth problem of graphs (Q698370) (← links)
- Bounds on mincut for Cayley graphs over Abelian groups (Q733724) (← links)
- On minimizing width in linear layouts (Q751660) (← links)
- Routing with critical paths (Q910228) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- On the complexity of tree embedding problems (Q1209372) (← links)
- Call routing and the ratcatcher (Q1330799) (← links)
- Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312) (← links)
- On 3-cutwidth critical graphs (Q1420615) (← links)
- The cutwidth of trees with diameters at most 4 (Q1430969) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- Minimal congestion trees (Q1877665) (← links)
- On the dynamics of the glass transition on Bethe lattices (Q2433947) (← links)
- Cutwidth of the<i>r</i>-dimensional Mesh of<i>d</i>-ary Trees (Q2729628) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- Pathwidth of outerplanar graphs (Q3445500) (← links)
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (Q3773170) (← links)
- Linear arrangement problems on recursively partitioned graphs (Q3778551) (← links)
- A variation on the min cut linear arrangement problem (Q3785979) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)
- Cutwidth of the de Bruijn graph (Q4359288) (← links)
- Principal component analysis for evaluating the feasibility of cellular manufacturing without initial machine-part matrix clustering (Q4394324) (← links)
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885) (← links)