An Experimental Study on Generating Planar Graphs
From MaRDI portal
Publication:3004691
DOI10.1007/978-3-642-21204-8_39zbMath1329.05284OpenAlexW2202128494MaRDI QIDQ3004691
Dorothea Wagner, Sascha Meinert
Publication date: 3 June 2011
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000022486/1978085
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Experiments on data reduction for optimal domination in networks
- Realizability of Delaunay triangulations
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Generating labeled planar graphs uniformly at random
- Each maximal planar graph with exactly two separating triangles is Hamiltonian
- A refined search tree technique for dominating set on planar graphs
- An Experimental Study on Generating Planar Graphs
- Uniform random sampling of planar graphs in linear time
- Asymptotic enumeration and limit laws of planar graphs
- Approximating Clustering Coefficient and Transitivity
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Generation of Triangulations of the Sphere
