On minimizing width in linear layouts
From MaRDI portal
DOI10.1016/0166-218X(89)90016-4zbMATH Open0715.05012WikidataQ128127009 ScholiaQ128127009MaRDI QIDQ751660FDOQ751660
Fillia Makedon, I. H. Sudborough
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of searching a graph
- Recontamination does not help to search a graph
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Complexity Results for Bandwidth Minimization
- Topological Bandwidth
- A polynomial algorithm for the min-cut linear arrangement of trees
- Title not available (Why is that?)
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- One-dimensional logic gate assignment and interval graphs
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
Cited In (27)
- Title not available (Why is that?)
- Multistart search for the cyclic cutwidth minimization problem
- Searching expenditure and interval graphs
- Graph classes and the switch Markov chain for matchings
- LINEAR LAYOUT OF GENERALIZED HYPERCUBES
- An annotated bibliography on guaranteed graph searching
- The cutwidth of trees with diameters at most 4
- On Cutwidth Parameterized by Vertex Cover
- Cooperative exploration and protection of a workspace assisted by information networks
- Minimal congestion trees
- On the domination search number
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Edge and node searching problems on trees
- Branch and bound for the cutwidth minimization problem
- On the monotonicity of games generated by symmetric submodular functions.
- Algorithms and obstructions for linear-width and related search parameters
- Bandwidth and density for block graphs
- Cutwidth I: A linear time fixed parameter algorithm
- On cutwidth parameterized by vertex cover
- Tree-width, path-width, and cutwidth
- Distributed chasing of network intruders
- Nondeterministic graph searching: from pathwidth to treewidth
- One-visibility cops and robber on trees: optimal cop-win strategies
- Linear layouts of generalized hypercubes
- Scatter search for the cutwidth minimization problem
- Minimal cutwidth linear arrangements of abelian Cayley graphs
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
Recommendations
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)
