Fast enumeration algorithms for non-crossing geometric graphs

Fast enumeration algorithms for non-crossing geometric graphs. Katoh, N. & Tanigawa, S. Discrete and Computational Geometry, 42(3):443--468, ACM Press, New York, New York, USA, April, 2009.

Paper doi bibtex

@article{ Katoh2009a,
  address = {New York, New York, USA},
  author = {Katoh, Naoki and Tanigawa, Shin-ichi},
  doi = {10.1007/s00454-009-9164-4},
  file = {:Users/KunihiroWASA/Dropbox/paper/2009/Katoh, Tanigawa, Fast enumeration algorithms for non-crossing geometric graphs, 2009(2).pdf:pdf},
  isbn = {9781605580715},
  issn = {01795376},
  journal = {Discrete and Computational Geometry},
  keywords = {Enumeration,Non-crossing geometric graphs,Triangulations},
  month = {April},
  number = {3},
  pages = {443--468},
  publisher = {ACM Press},
  title = {{Fast enumeration algorithms for non-crossing geometric graphs}},
  url = {http://link.springer.com/10.1007/s00454-009-9164-4},
  volume = {42},
  year = {2009}
}

Downloads: 0

{"_id":"FyEQKdtZBNkkHXLww","authorIDs":[],"author_short":["Katoh, N.","Tanigawa, S."],"bibbaseid":"katoh-tanigawa-fastenumerationalgorithmsfornoncrossinggeometricgraphs-2009","bibdata":{"address":"New York, New York, USA","author":["Katoh, Naoki","Tanigawa, Shin-ichi"],"author_short":["Katoh, N.","Tanigawa, S."],"bibtex":"@article{ Katoh2009a,\n address = {New York, New York, USA},\n author = {Katoh, Naoki and Tanigawa, Shin-ichi},\n doi = {10.1007/s00454-009-9164-4},\n file = {:Users/KunihiroWASA/Dropbox/paper/2009/Katoh, Tanigawa, Fast enumeration algorithms for non-crossing geometric graphs, 2009(2).pdf:pdf},\n isbn = {9781605580715},\n issn = {01795376},\n journal = {Discrete and Computational Geometry},\n keywords = {Enumeration,Non-crossing geometric graphs,Triangulations},\n month = {April},\n number = {3},\n pages = {443--468},\n publisher = {ACM Press},\n title = {{Fast enumeration algorithms for non-crossing geometric graphs}},\n url = {http://link.springer.com/10.1007/s00454-009-9164-4},\n volume = {42},\n year = {2009}\n}","bibtype":"article","doi":"10.1007/s00454-009-9164-4","file":":Users/KunihiroWASA/Dropbox/paper/2009/Katoh, Tanigawa, Fast enumeration algorithms for non-crossing geometric graphs, 2009(2).pdf:pdf","id":"Katoh2009a","isbn":"9781605580715","issn":"01795376","journal":"Discrete and Computational Geometry","key":"Katoh2009a","keywords":"Enumeration,Non-crossing geometric graphs,Triangulations","month":"April","number":"3","pages":"443--468","publisher":"ACM Press","title":"Fast enumeration algorithms for non-crossing geometric graphs","type":"article","url":"http://link.springer.com/10.1007/s00454-009-9164-4","volume":"42","year":"2009","bibbaseid":"katoh-tanigawa-fastenumerationalgorithmsfornoncrossinggeometricgraphs-2009","role":"author","urls":{"Paper":"http://link.springer.com/10.1007/s00454-009-9164-4"},"keyword":["Enumeration","Non-crossing geometric graphs","Triangulations"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.109Z","downloads":0,"keywords":["enumeration","non-crossing geometric graphs","triangulations"],"search_terms":["fast","enumeration","algorithms","non","crossing","geometric","graphs","katoh","tanigawa"],"title":"Fast enumeration algorithms for non-crossing geometric graphs","year":2009,"dataSources":["YRMeqhMHoNu9HzJoC"]}