The following pages link to (Q4250184):
Displaying 18 items.
- Flow metrics (Q596135) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- New results on the computation of median orders (Q1356737) (← links)
- Approximation algorithms for maximum linear arrangement (Q1603380) (← links)
- Vertex ordering and partitioning problems for random spatial graphs. (Q1884828) (← links)
- Efficient reassembling of graphs. I: The linear case (Q2359807) (← links)
- Memory management optimization problems for integrated circuit simulators (Q2383536) (← links)
- \(d\)-dimensional arrangement revisited (Q2444745) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems (Q2755062) (← links)
- New results of ant algorithms for the linear ordering problem (Q2893627) (← links)
- (Q3680598) (← links)
- A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
- Experiments on the minimum linear arrangement problem (Q5463444) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902508) (← links)
- Order-\(N\) methodologies and their applications (Q5949816) (← links)
