scientific article; zbMATH DE number 1303559

zbMath0930.68108MaRDI QIDQ4250184

No author found.

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

planar graphsspreading metrics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (11)

Efficient reassembling of graphs. I: The linear case ⋮ Vertex ordering and partitioning problems for random spatial graphs. ⋮ \(\ell ^2_2\) spreading metrics for vertex ordering problems ⋮ Memory management optimization problems for integrated circuit simulators ⋮ Flow metrics ⋮ Advances in metric embedding theory ⋮ Low-light trees, and tight lower bounds for Euclidean spanners ⋮ On the interval completion of chordal graphs ⋮ A branch and bound algorithm for the minimum storage-time sequencing problem ⋮ Experiments on the minimum linear arrangement problem ⋮ Approximation algorithms for maximum linear arrangement

This page was built for publication: