Crossing numbers and stress of random graphs
From MaRDI portal
Publication:1725756
DOI10.1007/978-3-030-04414-5_18OpenAlexW2888463608MaRDI QIDQ1725756
Matthias Reitzner, Markus Chimani, Hanna Döring
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.07558
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic analysis for Poisson point processes. Malliavin calculus, Wiener-Itô chaos expansions and stochastic geometry
- Crossing number and weighted crossing number of near-planar graphs
- Vertex insertion approximates the crossing number of apex graphs
- Poisson process Fock space representation, chaos expansion and covariance inequalities
- Some provably hard crossing number problems
- A new modified logarithmic Sobolev inequality for Poisson point processes and several applications
- Crossing numbers and stress of random graphs
- Hardness of approximation for crossing number
- A tighter insertion-based approximation of the crossing number
- Limit theory for the Gilbert graph
- Central limit theorems for \(U\)-statistics of Poisson point processes
- Are Crossings Important for Drawing Large Graphs?
- Approximating the Rectilinear Crossing Number
- Crossing Number is NP-Complete
- The crossing number of a projective graph is quadratic in the face–width
- Stochastic and Integral Geometry
- An Experimental Study on Distance-Based Graph Drawing
- Crossing-Free Subgraphs
- Crossing Numbers of Graphs
- Graph Drawing by Classical Multidimensional Scaling: New Perspectives
- Lectures on the Poisson Process
- Approximating the Crossing Number of Toroidal Graphs
- An algorithm for the graph crossing number problem
- Improved Bounds for the Crossing Numbers of Km,n and Kn
This page was built for publication: Crossing numbers and stress of random graphs
