Counting and Enumerating Crossing-free Geometric Graphs
DOI10.1145/2582112.2582145zbMath1395.68319OpenAlexW1994969571MaRDI QIDQ4635522
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
triangulationscountingperfect matchingsspanning treescrossing-free geometric graphsenumeratingconvex partitionsconvex subdivisionsspanning cycles
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 algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (8)
This page was built for publication: Counting and Enumerating Crossing-free Geometric Graphs