A polynomial algorithm for the min-cut linear arrangement of trees
From MaRDI portal
Recommendations
Cited in
(57)- Bounds on the convex label number of trees
- Min Cut is NP-complete for edge weighted trees
- On the complexity of tree embedding problems
- Call routing and the ratcatcher
- Parallel algorithms for the minimum cut and the minimum length tree layout problems
- On 3-cutwidth critical graphs
- The cutwidth of trees with diameters at most 4
- Edge and node searching problems on trees
- Scheduling series-parallel task graphs to minimize peak memory
- Cutwidth: obstructions and algorithmic aspects
- Tree-width, path-width, and cutwidth
- Minimal congestion trees
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- A polynomial algorithm for deciding the validity of an electrical distribution tree
- Decomposability of a class of \(k\)-cutwidth critical graphs
- Decompositions of critical trees with cutwidth k
- Pebbling meets coloring: reversible pebble game on trees
- Characterizations of \(k\)-cutwidth critical trees
- On the dynamics of the glass transition on Bethe lattices
- The theory of guaranteed search on graphs
- Cutwidth of the r-dimensional mesh of d-ary trees
- On cutwidth parameterized by vertex cover
- Computing the cutwidth of bipartite permutation graphs in linear time
- Reversible pebble game on trees
- Dynamics of Ising models near zero temperature: real-space renormalization approach
- Dynamical barriers for the random ferromagnetic Ising model on the Cayley tree: traveling-wave solution of the real space renormalization flow
- Branch and bound for the cutwidth minimization problem
- Pathwidth of outerplanar graphs
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- Linear arrangement problems on recursively partitioned graphs
- A variation on the min cut linear arrangement problem
- Cutwidth of triangular grids
- Polynomial-time self-reducibility: theoretical motivations and practical results∗
- scientific article; zbMATH DE number 177539 (Why is no real title available?)
- Cutwidth of the de Bruijn graph
- Principal component analysis for evaluating the feasibility of cellular manufacturing without initial machine-part matrix clustering
- The structure of graphs not admitting a fixed immersion
- On cutwidth parameterized by vertex cover
- A correction on Shiloach's algorithm for minimum linear arrangement of trees
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
- A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- Strong SDP based bounds on the cutwidth of a graph
- Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes
- Parameterized algorithms for minimum sum vertex cover
- Complexity of the virtual network embedding with uniform demands
- \textsc{Telephone Broadcast} on graphs of treewidth two
- A degree sequence method for the cutwidth problem of graphs
- Edge-maximal graphs with cutwidth at most three
- Parameterized algorithms for minimum sum vertex cover
- Bounds on mincut for Cayley graphs over Abelian groups
- Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
- On minimizing width in linear layouts
- Routing with critical paths
- Minimal cutwidth linear arrangements of abelian Cayley graphs
This page was built for publication: A polynomial algorithm for the min-cut linear arrangement of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771641)
