Fast enumeration algorithms for non-crossing geometric graphs

DOI10.1145/1377676.1377733zbMath1221.05295OpenAlexW2017870334MaRDI QIDQ5901415

Shin-ichi Tanigawa, Naoki Katoh

Publication date: 12 February 2009

Published in: Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/84844

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Counting Plane Graphs with Exponential Speed-Up ⋮ Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees

This page was built for publication: Fast enumeration algorithms for non-crossing geometric graphs