Counting and enumerating crossing-free geometric graphs
DOI10.1145/2582112.2582145zbMATH Open1395.68319OpenAlexW1994969571MaRDI QIDQ4635522FDOQ4635522
Authors: Manuel Wettstein 
Publication date: 23 April 2018
Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/314615
Recommendations
spanning treestriangulationsperfect matchingscountingcrossing-free geometric graphsenumeratingconvex partitionsconvex subdivisionsspanning cycles
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (25)
- Counting Plane Graphs: Cross-Graph Charging Schemes
- Counting plane graphs with exponential speed-up
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
- Counting crossing-free structures
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Loopless Gray code enumeration and the Tower of Bucharest
- Number of crossing-free geometric graphs vs. Triangulations
- Enumeration of bipartite non-crossing geometric graphs
- Crossing-free perfect matchings in wheel point sets
- The Number of Crossing Free Configurations on Finite Point Sets in the Plane
- Counting triangulations and other crossing-free structures via onion layers
- Reporting the crossing-free segments of a complete geometric graph
- On crossing numbers of geometric proximity graphs
- Counting and enumerating crossing-free geometric graphs
- Convex polygons in geometric triangulations
- Parameterized analysis and crossing minimization problems
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Fast enumeration algorithms for non-crossing geometric graphs
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- A QPTAS for the base of the number of crossing-free structures on a planar point set
- Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Counting the number of crossings in geometric graphs
- Counting triangulations and other crossing-free structures approximately
- Faradžev Read-type enumeration of non-isomorphic CC systems
This page was built for publication: Counting and enumerating crossing-free geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635522)
