Linear orderings of random geometric graphs

DOI10.1007/3-540-46784-X_28MaRDI QIDQ4944988zbMATH OpenFDO

Authors Mathew D. Penrose, Jordi Petit, J. Díaz, Maria Serna

Publication date 3 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46784-X_28

zbMATH Keywords

layout problemsrandom geometric graphs

Mathematics Subject Classification ID

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

Recommendations

• The Structure of Random Graph Orders
• scientific article; zbMATH DE number 970794
• Random graph orders
• On the degree sequence of random geometric digraphs
• scientific article; zbMATH DE number 5942363
• Random Geometric Graphs
• scientific article; zbMATH DE number 1775054
• Vertex order in some large constrained random graphs
• Random graphs, geometry and asymptotic structure

Cited in

(4)

• Approximating layout problems on random geometric graphs
• Learning random points from geometric graphs or orderings
• Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
• Approximating layout problems on random graphs

This page was built for publication: Linear orderings of random geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944988)