Pages that link to "Item:Q3951561"
From MaRDI portal
The following pages link to Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees (Q3951561):
Displayed 20 items.
- On minimizing width in linear layouts (Q751660) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Graphs with small bandwidth and cutwidth (Q1117949) (← links)
- The cyclic cutwidth of trees (Q1270769) (← links)
- Maximum cutwidth problem for graphs. (Q1413710) (← links)
- The cutwidth of trees with diameters at most 4 (Q1430969) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Vertex ordering and partitioning problems for random spatial graphs. (Q1884828) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- On the dynamics of the glass transition on Bethe lattices (Q2433947) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Cutwidth of the<i>r</i>-dimensional Mesh of<i>d</i>-ary Trees (Q2729628) (← links)
- Topological Bandwidth (Q3691781) (← links)
- Embedding Outerplanar Graphs in Small Books (Q3749074) (← links)
- Cutwidth of the de Bruijn graph (Q4359288) (← links)