Fast generation of some classes of planar graphs
From MaRDI portal
Recommendations
- Fast generation of planar graphs
- STACS 2004
- An experimental study on generating planar graphs
- Fast uniform generation of regular graphs
- Fast generation of regular graphs and construction of cages
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- A faster algorithm for computing the girth of planar and bounded genus graphs
- A fast algorithm for the product structure of planar graphs
- Faster shortest-path algorithms for planar graphs
- Faster shortest-path algorithms for planar graphs
Cites work
- scientific article; zbMATH DE number 1026567 (Why is no real title available?)
- scientific article; zbMATH DE number 1522743 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- Isomorph-Free Exhaustive Generation
- Polyhedra of small order and their Hamiltonian properties
Cited in
(22)- Construction of planar triangulations with minimum degree 5
- A Note on Universal Point Sets for Planar Graphs
- Enumeration of irreducible contact graphs on the sphere
- To be or not to be Yutsis: algorithms for the decision problem
- Biregular (and regular) planar cages
- Topological phases: an expedition off lattice
- The construction of cubic and quartic planar maps with prescribed face degrees
- Generation of various classes of trivalent graphs
- Fast generation of planar graphs
- An enumeration of equilateral triangle dissections
- A note on universal point sets for planar graphs
- The strong thirteen spheres problem
- Generation of 3-connected, planar line graphs
- Extremal problems of circle packings on a sphere and irreducible contact graphs
- GPU algorithm for enumerating PL spheres of Picard number 4: application to toric topology
- Generation of simple quadrangulations of the sphere
- The soft-collinear bootstrap: \(\mathcal{N} = {4}\) Yang-Mills amplitudes at six- and seven-loops
- Optimal packings of congruent circles on a square flat torus
- Constant Time Generation of Biconnected Rooted Plane Graphs
- An experimental study on generating planar graphs
- Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
- Generation of cubic graphs
This page was built for publication: Fast generation of some classes of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741325)
