Crossing numbers and stress of random graphs

DOI10.1007/978-3-030-04414-5_18MaRDI QIDQ1725756zbMATH OpenOpenAlexFDO

Authors Markus Chimani, Hanna Döring, Matthias Reitzner

Publication date 15 February 2019

Full work available at URL https://arxiv.org/abs/1808.07558

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Crossing numbers of random graphs
• \(k\)-planar crossing number of random graphs and random regular graphs
• On crossing numbers of geometric proximity graphs
• scientific article; zbMATH DE number 2145247
• Space crossing numbers

Cites work

• A new modified logarithmic Sobolev inequality for Poisson point processes and several applications
• An algorithm for the graph crossing number problem
• An Experimental Study on Distance-Based Graph Drawing
• Approximating the crossing number of graphs embeddable in any orientable surface
• Approximating the Crossing Number of Toroidal Graphs
• Approximating the rectilinear crossing number
• Are crossings important for drawing large graphs?
• Central limit theorems for \(U\)-statistics of Poisson point processes
• Crossing number and weighted crossing number of near-planar graphs
• Crossing Number is NP-Complete
• Crossing numbers and stress of random graphs
• Crossing numbers of graphs
• Crossing-Free Subgraphs
• Graph drawing by classical multidimensional scaling: new perspectives
• Hardness of approximation for crossing number
• scientific article; zbMATH DE number 1188564 (Why is no real title available?)
• scientific article; zbMATH DE number 7278018 (Why is no real title available?)
• Improved Bounds for the Crossing Numbers of Km,n and Kn
• Inserting multiple edges into a planar graph
• Lectures on the Poisson Process
• Limit theory for the Gilbert graph
• Poisson process Fock space representation, chaos expansion and covariance inequalities
• Some provably hard crossing number problems
• Stochastic analysis for Poisson point processes. Malliavin calculus, Wiener-Itô chaos expansions and stochastic geometry
• Stochastic and Integral Geometry
• The crossing number of a projective graph is quadratic in the face–width
• Vertex insertion approximates the crossing number of apex graphs

Cited in

(6)

• Crossing numbers and stress of random graphs
• Expected crossing numbers
• Crossing numbers of random graphs
• Edge crossings in random linear arrangements
• Crossing Numbers and Stress of Random Graphs
• Limit theorems for the number of crossings and stress in projections of a random geometric graph

This page was built for publication: Crossing numbers and stress of random graphs

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