Fast Enumeration Algorithms for Non-crossing Geometric Graphs

Naoki Katoh, Shin-ichi Tanigawa. Fast Enumeration Algorithms for Non-crossing Geometric Graphs. Discrete & Computational Geometry, 42(3):443-468, 2009. [doi]

@article{KatohT09-2,
  title = {Fast Enumeration Algorithms for Non-crossing Geometric Graphs},
  author = {Naoki Katoh and Shin-ichi Tanigawa},
  year = {2009},
  doi = {10.1007/s00454-009-9164-4},
  url = {http://dx.doi.org/10.1007/s00454-009-9164-4},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KatohT09-2},
  cites = {0},
  citedby = {0},
  journal = {Discrete & Computational Geometry},
  volume = {42},
  number = {3},
  pages = {443-468},
}