scientific article; zbMATH DE number 5050599
From MaRDI portal
Publication:5485334
zbMATH Open1104.68083MaRDI QIDQ5485334FDOQ5485334
Publication date: 29 August 2006
Title of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (7)
- Random graphs on surfaces
- Distributed computation of virtual coordinates for greedy routing in sensor networks
- On properties of random dissections and triangulations
- Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Uniform random sampling of planar graphs in linear time
- Asymptotic enumeration and limit laws of planar graphs
Recommendations
- Uniform random sampling of planar graphs in linear time 👍 👎
- Generating Random Hyperbolic Graphs in Subquadratic Time 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Generating labeled planar graphs uniformly at random 👍 👎
- Approximating the Diameter of Planar Graphs in Near Linear Time 👍 👎
- Approximating the Diameter of Planar Graphs in Near Linear Time 👍 👎
- Linear-Time Generation of Random Chordal Graphs 👍 👎
- Generalized quasirandom graphs 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485334)
