Pages that link to "Item:Q751660"
From MaRDI portal
The following pages link to On minimizing width in linear layouts (Q751660):
Displaying 20 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- The cutwidth of trees with diameters at most 4 (Q1430969) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Bandwidth and density for block graphs (Q1584358) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- On the domination search number (Q1811076) (← links)
- Minimal congestion trees (Q1877665) (← links)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- One-visibility cops and robber on trees: optimal cop-win strategies (Q2079862) (← links)
- Cooperative exploration and protection of a workspace assisted by information networks (Q2248545) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
