Fast enumeration algorithms for non-crossing geometric graphs

DOI10.1145/1377676.1377733MaRDI QIDQ5901415zbMATH OpenOpenAlexFDO

Authors Naoki Katoh, Shin-Ichi Tanigawa

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

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

Cited in

(8)

• Faster Algorithms to Enumerate Hypergraph Transversals
• Counting plane graphs with exponential speed-up
• scientific article; zbMATH DE number 437554 (Why is no real title available?)
• Enumerating Constrained Non-crossing Geometric Spanning Trees
• Efficient enumeration of non-isomorphic interval graphs
• Fast enumeration algorithms for non-crossing geometric graphs
• Efficient enumeration of non-isomorphic Ptolemaic graphs
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901415)