On the number of plane graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 504-513

  Aichholzer, Oswin ^a   Hackl, Thomas ^a   Vogtenhuber, Birgit ^a   Huemer, Clemens ^b   Hurtado, Ferran ^b   Krasser, Hannes ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; NUMBER THEORY; POLYNOMIALS; SET THEORY; TREES (MATHEMATICS);

CYCLE-FREE GRAPHS; PLANE GRAPHS; SPANNING TREES;

GRAPH THEORY;

EID: 33244474611     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109613     Document Type: Conference Paper

References (21)

1. O.Aichholzer, Rectilinear Crossing Number Page. http:www.ist.tura. ataichholercrossins.html
2. O.Aichholzer, F.Aurenhammer, H.Krasser, Enumerating order types for small point sets with applications. Order 19, pp. 265-281, 2002.
3. th ACM Symposium on Computational Geometry, Barcelona, Spain, pp. 19-24, 2002.
4. O.Aichholzer, F.Aurenhammer, H.Krasser, and B.Speckmann, Convexity minimizes pseudo triangulations. Computational Geometry: Theory and Applications 28, pp. 3-10, 2004.
5. O.Aichholzer, F.Hurtado, and M.Noy, A lower bound on the number of triangulations of planar point sets. Computational Geometry: Theory and Applications 29(2), pp. 135-145, 2004.
6. th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, pp. 17-20, 2001.
7. th ACM Symposium on Computational Geometry, Pisa, Italy, pp. 91-98, 2005.
8. th European Workshop on Computational Geometry, Sevilla, Spain, pp. 119-122, 2004.
9. M.Ajtai, V.Chvátal, M.Newborn, and E.Szemerédi, Crossing-free subgraphs. Ann. Discrete Mathematics 12, pp. 9-12, 1982.
10. P. Brass, W. Moser and J. Pach, Research Problems in Discrete Geometry. Springer-Verlag, New York, 2005.
11. th Canadian Conference on Computational Geometry, pp. 111-114, 1999.
12. P.Erdös, R.K.Guy, Crossing number problems. Amer. Math. Monthly 80, pp. 52-58, 1973.
13. P.Flajolet, M.Noy, Analytic combinatorics of non-crossing configurations. Discrete Mathematics 204, pp. 203-229, 1999.
14. n. Computational Geometry: Theory and Applications 16, pp. 211-221, 2000.
15. J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry. CRC Press LLC, Boca Raton, FL; Second Edition, April 2004.
16. T.Leighton, Complexity issues in VLSI. MIT Press, Cambridge MA, 1983.
17. D.Orden and F.Santos, The polytope of non-crossing graphs on a planar point set. Discrete Comput. Geom. 33(2), pp. 275-305, 2005.
18. A. Ribo Mor, G. Rote, Locked and Unlocked Self-Touching Linkages, personal communication (Ph.D. thesis of Ares Ribo Mor), 2005.
19. th Canadian Conference on Computational Geometry, pp. 149-152, 2001.
20. F.Santos, R.Seidel, A better upper bound on the number of triangulations of a planar point set. J. Combin. Theory Ser. A 102, pp. 186-193, 2003.
21. th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006.