Pages that link to "Item:Q1570828"
From MaRDI portal
The following pages link to On minimum cuts and the linear arrangement problem (Q1570828):
Displaying 12 items.
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- Ordered optimal solutions and parametric minimum cut problems (Q2568331) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- A variation on the min cut linear arrangement problem (Q3785979) (← links)
- (Q4546187) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)