Fast enumeration algorithms for non-crossing geometric graphs

From MaRDI portal
Publication:5896957

DOI10.1007/s00454-009-9164-4zbMath1177.05119OpenAlexW4233537290MaRDI QIDQ5896957

Naoki Katoh, Shin-ichi Tanigawa

Publication date: 27 August 2009

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-009-9164-4




Related Items (4)



Cites Work


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