On minimizing width in linear layouts
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3650583 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A polynomial algorithm for the min-cut linear arrangement of trees
- Complexity Results for Bandwidth Minimization
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- One-dimensional logic gate assignment and interval graphs
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- Recontamination does not help to search a graph
- The complexity of searching a graph
- Topological Bandwidth
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
Cited in
(29)- LINEAR LAYOUT OF GENERALIZED HYPERCUBES
- On cutwidth parameterized by vertex cover
- On the domination search number
- Linear layouts of generalized hypercubes
- Algorithms and obstructions for linear-width and related search parameters
- Scatter search for the cutwidth minimization problem
- scientific article; zbMATH DE number 3858434 (Why is no real title available?)
- Bandwidth and density for block graphs
- Graph classes and the switch Markov chain for matchings
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
- Distributed chasing of network intruders
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Searching expenditure and interval graphs
- Cooperative exploration and protection of a workspace assisted by information networks
- On the monotonicity of games generated by symmetric submodular functions.
- Graphs with small bandwidth and cutwidth
- Minimal cutwidth linear arrangements of abelian Cayley graphs
- One-visibility cops and robber on trees: optimal cop-win strategies
- Minimal congestion trees
- Edge and node searching problems on trees
- An annotated bibliography on guaranteed graph searching
- Tree-width, path-width, and cutwidth
- The cutwidth of trees with diameters at most 4
- On cutwidth parameterized by vertex cover
- Cutwidth I: A linear time fixed parameter algorithm
- Nondeterministic graph searching: from pathwidth to treewidth
- Linear layouts measuring neighbourhoods in graphs
- Branch and bound for the cutwidth minimization problem
- Multistart search for the cyclic cutwidth minimization problem
This page was built for publication: On minimizing width in linear layouts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751660)
