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):
Displaying 46 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Cutwidth of triangular grids (Q397153) (← links)
- The structure of graphs not admitting a fixed immersion (Q473098) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- 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)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- Minimal congestion trees (Q1877665) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Decomposability of a class of \(k\)-cutwidth critical graphs (Q2125221) (← links)
- Decompositions of critical trees with cutwidth \(k\) (Q2326339) (← links)
- Pebbling meets coloring: reversible pebble game on trees (Q2409574) (← links)
- Characterizations of \(k\)-cutwidth critical trees (Q2410043) (← links)
- On the dynamics of the glass transition on Bethe lattices (Q2433947) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← 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)
- Reversible Pebble Game on Trees (Q3196374) (← links)
- Dynamics of Ising models near zero temperature: real-space renormalization approach (Q3301525) (← links)
- Dynamical barriers for the random ferromagnetic Ising model on the Cayley tree: traveling-wave solution of the real space renormalization flow (Q3301610) (← 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)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
- Parameterized algorithms for minimum sum vertex cover (Q6547957) (← links)
