Approximating layout problems on random graphs

DOI10.1016/S0012-365X(00)00278-8zbMath0977.05128OpenAlexW2028111065MaRDI QIDQ5937937

Luca Trevisan, Josep Diaz, Maria J. Serna, Jordi Petit

Publication date: 18 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00278-8

zbMATH Keywords

probabilityrandom graphsoptimal costlayout problems

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)

Related Items (3)

Maximum cliques in graphs with small intersection number and random intersection graphs ⋮ Communication tree problems ⋮ Experiments on the minimum linear arrangement problem

This page was built for publication: Approximating layout problems on random graphs