An experimental study on generating planar graphs
From MaRDI portal
Recommendations
Cites work
- A refined search tree technique for dominating set on planar graphs
- An experimental study on generating planar graphs
- Approximating Clustering Coefficient and Transitivity
- Asymptotic enumeration and limit laws of planar graphs
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Each maximal planar graph with exactly two separating triangles is Hamiltonian
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Experiments on data reduction for optimal domination in networks
- Fast generation of some classes of planar graphs
- Generating labeled planar graphs uniformly at random
- Generation of Triangulations of the Sphere
- scientific article; zbMATH DE number 2089218 (Why is no real title available?)
- scientific article; zbMATH DE number 1146225 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Realizability of Delaunay triangulations
- Uniform random sampling of planar graphs in linear time
Cited in
(2)
This page was built for publication: An experimental study on generating planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004691)